Coalition structure generation: A survey

Talal Rahwan, Tomasz P. Michalak, Michael Wooldridge, Nicholas R. Jennings

Research output: Contribution to journalReview article

Abstract

The coalition structure generation problem is a natural abstraction of one of the most important challenges in multi-agent systems: How can a number of agents divide themselves into groups in order to improve their performance? More precisely, the coalition structure generation problem focuses on partitioning the set of agents into mutually disjoint coalitions so that the total reward from the resulting coalitions is maximized. This problem is computationally challenging, even under quite restrictive assumptions. This has prompted researchers to develop a range of algorithms and heuristic approaches for solving the problem efficiently. This article presents a survey of these approaches. In particular, it surveys the main dynamic-programming approaches and anytime algorithms developed for coalition structure generation, and considers techniques specifically developed for a range of compact representation schemes for coalitional games. It also considers settings where there are constraints on the coalitions that are allowed to form, as well as settings where the formation of one coalition could influence the performance of other co-existing coalitions.

Original languageEnglish (US)
Pages (from-to)139-174
Number of pages36
JournalArtificial Intelligence
Volume229
DOIs
StatePublished - Dec 3 2015

Fingerprint

coalition
Multi agent systems
Dynamic programming
abstraction
performance
reward
heuristics
programming
Group

Keywords

  • Coalition structure generation
  • Coalitional games
  • Set partitioning

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence

Cite this

Rahwan, T., Michalak, T. P., Wooldridge, M., & Jennings, N. R. (2015). Coalition structure generation: A survey. Artificial Intelligence, 229, 139-174. https://doi.org/10.1016/j.artint.2015.08.004

Coalition structure generation : A survey. / Rahwan, Talal; Michalak, Tomasz P.; Wooldridge, Michael; Jennings, Nicholas R.

In: Artificial Intelligence, Vol. 229, 03.12.2015, p. 139-174.

Research output: Contribution to journalReview article

Rahwan, T, Michalak, TP, Wooldridge, M & Jennings, NR 2015, 'Coalition structure generation: A survey', Artificial Intelligence, vol. 229, pp. 139-174. https://doi.org/10.1016/j.artint.2015.08.004
Rahwan, Talal ; Michalak, Tomasz P. ; Wooldridge, Michael ; Jennings, Nicholas R. / Coalition structure generation : A survey. In: Artificial Intelligence. 2015 ; Vol. 229. pp. 139-174.
@article{cfceaeef663246458cf6d56fc28279e8,
title = "Coalition structure generation: A survey",
abstract = "The coalition structure generation problem is a natural abstraction of one of the most important challenges in multi-agent systems: How can a number of agents divide themselves into groups in order to improve their performance? More precisely, the coalition structure generation problem focuses on partitioning the set of agents into mutually disjoint coalitions so that the total reward from the resulting coalitions is maximized. This problem is computationally challenging, even under quite restrictive assumptions. This has prompted researchers to develop a range of algorithms and heuristic approaches for solving the problem efficiently. This article presents a survey of these approaches. In particular, it surveys the main dynamic-programming approaches and anytime algorithms developed for coalition structure generation, and considers techniques specifically developed for a range of compact representation schemes for coalitional games. It also considers settings where there are constraints on the coalitions that are allowed to form, as well as settings where the formation of one coalition could influence the performance of other co-existing coalitions.",
keywords = "Coalition structure generation, Coalitional games, Set partitioning",
author = "Talal Rahwan and Michalak, {Tomasz P.} and Michael Wooldridge and Jennings, {Nicholas R.}",
year = "2015",
month = "12",
day = "3",
doi = "10.1016/j.artint.2015.08.004",
language = "English (US)",
volume = "229",
pages = "139--174",
journal = "Artificial Intelligence",
issn = "0004-3702",
publisher = "Elsevier",

}

TY - JOUR

T1 - Coalition structure generation

T2 - A survey

AU - Rahwan, Talal

AU - Michalak, Tomasz P.

AU - Wooldridge, Michael

AU - Jennings, Nicholas R.

PY - 2015/12/3

Y1 - 2015/12/3

N2 - The coalition structure generation problem is a natural abstraction of one of the most important challenges in multi-agent systems: How can a number of agents divide themselves into groups in order to improve their performance? More precisely, the coalition structure generation problem focuses on partitioning the set of agents into mutually disjoint coalitions so that the total reward from the resulting coalitions is maximized. This problem is computationally challenging, even under quite restrictive assumptions. This has prompted researchers to develop a range of algorithms and heuristic approaches for solving the problem efficiently. This article presents a survey of these approaches. In particular, it surveys the main dynamic-programming approaches and anytime algorithms developed for coalition structure generation, and considers techniques specifically developed for a range of compact representation schemes for coalitional games. It also considers settings where there are constraints on the coalitions that are allowed to form, as well as settings where the formation of one coalition could influence the performance of other co-existing coalitions.

AB - The coalition structure generation problem is a natural abstraction of one of the most important challenges in multi-agent systems: How can a number of agents divide themselves into groups in order to improve their performance? More precisely, the coalition structure generation problem focuses on partitioning the set of agents into mutually disjoint coalitions so that the total reward from the resulting coalitions is maximized. This problem is computationally challenging, even under quite restrictive assumptions. This has prompted researchers to develop a range of algorithms and heuristic approaches for solving the problem efficiently. This article presents a survey of these approaches. In particular, it surveys the main dynamic-programming approaches and anytime algorithms developed for coalition structure generation, and considers techniques specifically developed for a range of compact representation schemes for coalitional games. It also considers settings where there are constraints on the coalitions that are allowed to form, as well as settings where the formation of one coalition could influence the performance of other co-existing coalitions.

KW - Coalition structure generation

KW - Coalitional games

KW - Set partitioning

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

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

U2 - 10.1016/j.artint.2015.08.004

DO - 10.1016/j.artint.2015.08.004

M3 - Review article

AN - SCOPUS:84940655811

VL - 229

SP - 139

EP - 174

JO - Artificial Intelligence

JF - Artificial Intelligence

SN - 0004-3702

ER -