The University of Southampton
University of Southampton Institutional Repository

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

Record type: Conference or Workshop Item (Other)

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.

PDF Rahwan_Michalak_Jennings_1338_camera_ready.pdf - Version of Record
Download (297kB)
PDF __userfiles.soton.ac.uk_Users_nsc_mydesktop_272270rahwan.pdf - Version of Record
Download (690kB)
PDF __userfiles.soton.ac.uk_Users_nsc_mydesktop_272270datedrahwan.pdf - Version of Record
Restricted to Repository staff only
Download (371kB)

Citation

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, Spain. 16 - 22 Jul 2011. , pp. 338-343. (doi:10.5591/978-1-57735-516-8/IJCAI11-066).

More information

Published date: July 2011
Venue - Dates: IJCAI'11. Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence - Volume One, Spain, 2011-07-16 - 2011-07-22
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 272270
URI: http://eprints.soton.ac.uk/id/eprint/272270
ISBN: 978-1-57735-513-7
PURE UUID: dd2b120d-9ee2-4930-8d5c-00df5d0a9668

Catalogue record

Date deposited: 11 May 2011 08:03
Last modified: 18 Jul 2017 06:32

Export record

Altmetrics

Contributors

Author: Talal Rahwan
Author: Tomasz Michalak
Author: Nicholas R. Jennings

University divisions


Download statistics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×