Sciweavers

Share
EUMAS
2006

Near-Optimal Anytime Coalition Structure Generation

12 years 3 months ago
Near-Optimal Anytime Coalition Structure Generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that should participate in a given team. To this end, in this paper, we present a novel, anytime algorithm for coalition structure generation that is faster than previous anytime algorithms designed for this purpose. Our algorithm can generate solutions that either have a tight bound from the optimal or are optimal (depending on the objective) and works by partitioning the space in terms of a small set of elements that represent structures which contain coalitions of particular sizes. It then performs an online heuristic search that prunes the space and only considers valid and non-redundant coalition structures. We empirically show that we are able to find solutions that are, in the worst case, 99% efficient in 0.0043% of the time to find the optimal value by the state of the art dynamic programming (DP) algorit...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2006
Where EUMAS
Authors Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dang, Nicholas R. Jennings
Comments (0)
books