Sciweavers

Share
ECAI
2010
Springer

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

10 years 5 months ago
Egalitarian Utilities Divide-and-Coordinate: Stop arguing about decisions, let's share rewards!
Abstract. In this paper we formulate a novel Divide-andCoordinate (DaC) algorithm, the so-called Egalitarian Utilities Divide-and-Coordinate (EU-DaC) algorithm. The Divide-andCoordinate (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 maxmarginals 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.
Meritxell Vinyals, Juan A. Rodríguez-Aguila
Added 08 Nov 2010
Updated 08 Nov 2010
Type Conference
Year 2010
Where ECAI
Authors Meritxell Vinyals, Juan A. Rodríguez-Aguilar, Jesús Cerquides
Comments (0)
books