Near-optimal anytime coalition structure generation


Rahwan, T., Ramchurn, S.D., Dang, V.D. and Jennings, N. R. (2007) Near-optimal anytime coalition structure generation At 20th International Joint Conference on Artificial Intelligence (IJCAI), India. , pp. 2365-2371.

Download

[img] PDF ijcai07-rahwan.pdf - Other
Download (1MB)

Description/Abstract

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 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) algorithm (for 20 agents), using 33% less memory.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: 20th International Joint Conference on Artificial Intelligence (IJCAI), India, 2007-01-01
Organisations: Agents, Interactions & Complexity
ePrint ID: 263074
Date :
Date Event
2007Published
Date Deposited: 06 Oct 2006
Last Modified: 17 Apr 2017 21:32
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/263074

Actions (login required)

View Item View Item