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

Rahwan, Talal, Michalak , Tomasz and Jennings, Nicholas R. (2011) Minimum search to establish worst-case guarantees in coalition structure generation. At IJCAI'11. Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence - Volume One, Barcelona, ES, 16 - 22 Jul 2011. , 338-343. (doi:10.5591/978-1-57735-516-8/IJCAI11-066).


[img] PDF - Published Version
Download (290Kb)
PDF - Version of Record
Download (673Kb) | Preview
[img] PDF - Version of Record
Restricted to internal admin

Download (362Kb) | Request a copy


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 (beta) 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.

Item Type: Conference or Workshop Item (Speech)
Digital Object Identifier (DOI): doi:10.5591/978-1-57735-516-8/IJCAI11-066
ISBNs: 9781577355137 (hardback)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
ePrint ID: 272270
Date Deposited: 11 May 2011 08:03
Last Modified: 14 Apr 2014 11:35
Further Information:Google Scholar

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics