Egalitarian Utilities Divide-and-Coordinate: Stop arguing about decisions, let's share rewards!

Authors:
Meritxell Vinyals;Juan Antonio Rodriguez-Aguilar;Jesus Cerquides
Affiliations:
Artificial Intelligence Research Institute (IIIA), Spanish Scientific Research Council (CSIC), Campus UAB, Bellaterra, Spain;Artificial Intelligence Research Institute (IIIA), Spanish Scientific Research Council (CSIC), Campus UAB, Bellaterra, Spain;Artificial Intelligence Research Institute (IIIA), Spanish Scientific Research Council (CSIC), Campus UAB, Bellaterra, Spain
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 3
Cited 1

Local optimization in cooperative agent networks

Local optimization in cooperative agent networks
Adopt: asynchronous distributed constraint optimization with quality guarantees

Artificial Intelligence - Special issue: Distributed constraint satisfaction
Divide-and-coordinate: DCOPs by agreement

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

Communication-constrained DCOPs: message approximation in GDL with function filtering

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we formulate a novel Divide-and-Coordinate (DaC) algorithm, the so-called Egalitarian Utilities Divide-and-Coordinate (EU-DaC) algorithm. The Divide-and-Coordinate (DaC) framework [3] is a family of bounded DCOP algorithms that solve DCOPs by exploiting the concept of agreement. The intuition behind EU-DaC is that agents get closer to an agreement, on the optimal solution, when they communicate the local max-marginals utilities for their assignments instead of only their preferred assignments. We provide empirical evidence supporting this hypothesis as well as illustrating the competitiveness of EU-DaC.