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. In, 20th International Joint Conference on Artificial Intelligence (IJCAI), Hyderabad, India, , 2365-2371.
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)|
|Divisions:||Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||06 Oct 2006|
|Last Modified:||26 May 2013 01:02|
|Contributors:||Rahwan, T. (Author)
Ramchurn, S.D. (Author)
Dang, V.D. (Author)
Jennings, N. R. (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||1|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)