Anytime dynamic programming for coalition structure generation

Authors:
Travis C. Service;Julie A. Adams
Affiliations:
Vanderbilt University, Nashville, Tennessee;Vanderbilt University, Nashville, Tennessee
Venue:
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Year:
2010

Citing 5
Cited 0

Anytime coalition structure generation: an average case study

Proceedings of the third annual conference on Autonomous Agents
Coalition structure generation with worst case guarantees

Artificial Intelligence
Coalition structure generation: dynamic programming meets anytime optimization

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
An anytime algorithm for optimal coalition structure generation

Journal of Artificial Intelligence Research
Constant factor approximation algorithms for coalition structure generation

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Determining the optimal coalition structure is a central problem in multi-agent systems. Two popular techniques include dynamic programming and anytime search algorithms. Dynamic programming algorithms guarantee an optimal solution and have the best worst case running time. Anytime algorithms are flexible as they can terminate before the search has completed, but have a significantly poorer worst case runtime. This paper provides an anytime dynamic programming algorithm with the worst case runtime of dynamic programming and the flexibility of anytime search.