Coalition structure generation
Coalition structure generation
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.
139-174
Rahwan, Talal
476029f3-5484-4747-9f44-f63f3687083c
Michalak, Tomasz
e24bfee3-bd75-4cca-8220-6f3c2f39dc38
Wooldridge, M
711a6c61-aec7-492d-bcf6-e08cb07d9286
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
December 2015
Rahwan, Talal
476029f3-5484-4747-9f44-f63f3687083c
Michalak, Tomasz
e24bfee3-bd75-4cca-8220-6f3c2f39dc38
Wooldridge, M
711a6c61-aec7-492d-bcf6-e08cb07d9286
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Rahwan, Talal, Michalak, Tomasz, Wooldridge, M and Jennings, Nicholas R.
(2015)
Coalition structure generation.
Artificial Intelligence, 229, .
(doi:10.1016/j.artint.2015.08.004).
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.
Text
__userfiles.soton.ac.uk_Library_SLAs_Work_for_ALL's_Work_for_ePrints_Accepted Manuscripts_Rahwan_Coalition.pdf
- Accepted Manuscript
Text
CSG survey published version.pdf
- Version of Record
Restricted to Repository staff only
Request a copy
Text
CSG_survey_preprint.pdf
- Other
More information
Accepted/In Press date: 13 August 2015
e-pub ahead of print date: 21 August 2015
Published date: December 2015
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 380855
URI: http://eprints.soton.ac.uk/id/eprint/380855
PURE UUID: 6ba918ae-3c41-4480-b890-84036db31508
Catalogue record
Date deposited: 25 Aug 2015 07:21
Last modified: 14 Mar 2024 21:06
Export record
Altmetrics
Contributors
Author:
Talal Rahwan
Author:
Tomasz Michalak
Author:
M Wooldridge
Author:
Nicholas R. Jennings
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