Minimum search to establish worst-case guarantees in coalition structure generation

  • Authors:

  • Talal Rahwan;Tomasz Michalak;Nicholas R. Jennings

  • Affiliations:

  • School of Electronics and Computer Science, University of Southampton, UK;School of Electronics and Computer Science, University of Southampton, UK and Institute of Informatics, University of Warsaw, Poland;School of Electronics and Computer Science, University of Southampton, UK

  • Venue:
  • IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Coalition formation is a fundamental research topic in multi-agent systems. In this context, while it is desirable to generate a coalition structure that maximizes the sum of the values of the coalitions, the space of possible solutions is often too large to allow exhaustive search. Thus, a fundamental open question in this area is the following: Can we search through only a subset of coalition structures, and be guaranteed to find a solution that is within a desirable bound β from optimum? If so, what is the minimum such subset?. To date, the above question has only been partially answered by Sandholm et al. in their seminal work on anytime coalition structure generation [Sandholm et al., 1999]. More specifically, they identified minimum subsets to be searched for two particular bounds: β = n and β = ⌈n/2⌉. Nevertheless, the question remained open for other values of β. In this paper, we provide the complete answer to this question.