An asynchronous complete method for distributed constraint optimization
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
The distributed breakout algorithms
Artificial Intelligence - Special issue: Distributed constraint satisfaction
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Adaptive price update in distributed Lagrangian relaxation protocol
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
PRIMA'11 Proceedings of the 14th international conference on Agents in Principle, Agents in Practice
Hi-index | 0.00 |
This paper presents a new distributed solution protocol, called DisLRPα, for the Generalized Mutual Assignment Problem (GMAP). The GMAP is a typical distributed combinatorial optimization problem whose goal is to maximize social welfare of the agents. Unlike the previous protocol for the GMAP, DisLRPα can provide a theoretical guarantee on global solution quality. In DisLRPα, as with in the previous protocol, the agents repeatedly solve their local problems while coordinating their local solutions using a distributed constraint satisfaction technique. The key difference is that, in DisLRPα, each agent is required to produce a feasible solution whose local objective value is not lower than α (0 α can certainly find a solution whose global objective value is higher than that theoretically guaranteed. Furthermore, they also show that, while spending extra communication and computation costs, DisLRPα can produce a significantly better solution than the previous protocol if we set α appropriately.