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

Talal Rahwan, Tomasz Michalak, Nicholas R. Jennings

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationIJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence
Pages338-342
Number of pages5
DOIs
StatePublished - Dec 1 2011
Event22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 - Barcelona, Catalonia, Spain
Duration: Jul 16 2011Jul 22 2011

Other

Other22nd International Joint Conference on Artificial Intelligence, IJCAI 2011
CountrySpain
CityBarcelona, Catalonia
Period7/16/117/22/11

Fingerprint

Multi agent systems

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Rahwan, T., Michalak, T., & Jennings, N. R. (2011). Minimum search to establish worst-case guarantees in coalition structure generation. In IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence (pp. 338-342) https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-066

Minimum search to establish worst-case guarantees in coalition structure generation. / Rahwan, Talal; Michalak, Tomasz; Jennings, Nicholas R.

IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence. 2011. p. 338-342.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rahwan, T, Michalak, T & Jennings, NR 2011, Minimum search to establish worst-case guarantees in coalition structure generation. in IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence. pp. 338-342, 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Catalonia, Spain, 7/16/11. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-066
Rahwan T, Michalak T, Jennings NR. Minimum search to establish worst-case guarantees in coalition structure generation. In IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence. 2011. p. 338-342 https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-066
Rahwan, Talal ; Michalak, Tomasz ; Jennings, Nicholas R. / Minimum search to establish worst-case guarantees in coalition structure generation. IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence. 2011. pp. 338-342
@inproceedings{4867c7b2100348859da69fd89e9b750c,
title = "Minimum search to establish worst-case guarantees in coalition structure generation",
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.",
author = "Talal Rahwan and Tomasz Michalak and Jennings, {Nicholas R.}",
year = "2011",
month = "12",
day = "1",
doi = "10.5591/978-1-57735-516-8/IJCAI11-066",
language = "English (US)",
isbn = "9781577355120",
pages = "338--342",
booktitle = "IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence",

}

TY - GEN

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

AU - Rahwan, Talal

AU - Michalak, Tomasz

AU - Jennings, Nicholas R.

PY - 2011/12/1

Y1 - 2011/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84868268213&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84868268213&partnerID=8YFLogxK

U2 - 10.5591/978-1-57735-516-8/IJCAI11-066

DO - 10.5591/978-1-57735-516-8/IJCAI11-066

M3 - Conference contribution

AN - SCOPUS:84868268213

SN - 9781577355120

SP - 338

EP - 342

BT - IJCAI 2011 - 22nd International Joint Conference on Artificial Intelligence

ER -