Anytime optimal coalition structure generation

  • Authors:
  • Talal Rahwan;Sarvapali D. Ramchurn;Viet D. Dang;Andrea Giovannucci;Nicholas R. Jennings

  • Affiliations:
  • School of Electronics and Computer Science, University of Southampton, Southampton, UK;School of Electronics and Computer Science, University of Southampton, Southampton, UK;Lost Wax Media Ltd., Richmond, Surrey, UK;Institute of Artificial Intelligence Research, CSIC, Bellaterra, Spain;School of Electronics and Computer Science, University of Southampton, Southampton, UK

  • Venue:
  • AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this end, we present a novel, anytime algorithm for this task that is significantly faster than current solutions. Specifically, we empirically show that we are able to find solutions that are optimal in 0.082% of the time taken by the state of the art dynamic programming algorithm (for 27 agents), using much less memory (O(2n) instead of O(3n) for n agents). Moreover, our algorithm is the first to be able to find solutions for more than 17 agents in reasonable time (less than 90 minutes for 27 agents, as opposed to around 2 months for the best previous solution).