Coalition structure generation and cs-core: Results on the tractability frontier for games represented by MC-nets

Julien Lesca, Patrice Perny, Makoto Yokoo

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

4 Citations (Scopus)

Abstract

The coalition structure generation (CSG) problem consists in partitioning a group of agents into coalitions to maximize the sum of their values. We consider here the rase of coalitional games whose characteristic function is compactly represented by a set of weighted conjunctive formulae (an MC-net). In this context the CSG problem is known to be computationally hard in general. In this paper, we first study some key parameters of MC- nets that complicate solving make the CSG problem. Then we consider a specific class of MC-nets, called bipolar MC- nets, and prove that the CSG problem is polynomial for this class. Finally, we show that the CS-core of a game represented by a bipolar MC-net is never empty, and that an imputation belonging to the CS-core can be computed in polynomial time.

Original languageEnglish
Title of host publication16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages308-316
Number of pages9
Volume1
ISBN (Electronic)9781510855076
Publication statusPublished - Jan 1 2017
Event16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017 - Sao Paulo, Brazil
Duration: May 8 2017May 12 2017

Other

Other16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017
CountryBrazil
CitySao Paulo
Period5/8/175/12/17

Fingerprint

Polynomials

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering

Cite this

Lesca, J., Perny, P., & Yokoo, M. (2017). Coalition structure generation and cs-core: Results on the tractability frontier for games represented by MC-nets. In 16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017 (Vol. 1, pp. 308-316). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

Coalition structure generation and cs-core : Results on the tractability frontier for games represented by MC-nets. / Lesca, Julien; Perny, Patrice; Yokoo, Makoto.

16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017. Vol. 1 International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2017. p. 308-316.

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

Lesca, J, Perny, P & Yokoo, M 2017, Coalition structure generation and cs-core: Results on the tractability frontier for games represented by MC-nets. in 16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017. vol. 1, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), pp. 308-316, 16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017, Sao Paulo, Brazil, 5/8/17.
Lesca J, Perny P, Yokoo M. Coalition structure generation and cs-core: Results on the tractability frontier for games represented by MC-nets. In 16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017. Vol. 1. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). 2017. p. 308-316
Lesca, Julien ; Perny, Patrice ; Yokoo, Makoto. / Coalition structure generation and cs-core : Results on the tractability frontier for games represented by MC-nets. 16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017. Vol. 1 International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2017. pp. 308-316
@inproceedings{f26e4a50c8574bc688e7ae7a0290b600,
title = "Coalition structure generation and cs-core: Results on the tractability frontier for games represented by MC-nets",
abstract = "The coalition structure generation (CSG) problem consists in partitioning a group of agents into coalitions to maximize the sum of their values. We consider here the rase of coalitional games whose characteristic function is compactly represented by a set of weighted conjunctive formulae (an MC-net). In this context the CSG problem is known to be computationally hard in general. In this paper, we first study some key parameters of MC- nets that complicate solving make the CSG problem. Then we consider a specific class of MC-nets, called bipolar MC- nets, and prove that the CSG problem is polynomial for this class. Finally, we show that the CS-core of a game represented by a bipolar MC-net is never empty, and that an imputation belonging to the CS-core can be computed in polynomial time.",
author = "Julien Lesca and Patrice Perny and Makoto Yokoo",
year = "2017",
month = "1",
day = "1",
language = "English",
volume = "1",
pages = "308--316",
booktitle = "16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017",
publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",

}

TY - GEN

T1 - Coalition structure generation and cs-core

T2 - Results on the tractability frontier for games represented by MC-nets

AU - Lesca, Julien

AU - Perny, Patrice

AU - Yokoo, Makoto

PY - 2017/1/1

Y1 - 2017/1/1

N2 - The coalition structure generation (CSG) problem consists in partitioning a group of agents into coalitions to maximize the sum of their values. We consider here the rase of coalitional games whose characteristic function is compactly represented by a set of weighted conjunctive formulae (an MC-net). In this context the CSG problem is known to be computationally hard in general. In this paper, we first study some key parameters of MC- nets that complicate solving make the CSG problem. Then we consider a specific class of MC-nets, called bipolar MC- nets, and prove that the CSG problem is polynomial for this class. Finally, we show that the CS-core of a game represented by a bipolar MC-net is never empty, and that an imputation belonging to the CS-core can be computed in polynomial time.

AB - The coalition structure generation (CSG) problem consists in partitioning a group of agents into coalitions to maximize the sum of their values. We consider here the rase of coalitional games whose characteristic function is compactly represented by a set of weighted conjunctive formulae (an MC-net). In this context the CSG problem is known to be computationally hard in general. In this paper, we first study some key parameters of MC- nets that complicate solving make the CSG problem. Then we consider a specific class of MC-nets, called bipolar MC- nets, and prove that the CSG problem is polynomial for this class. Finally, we show that the CS-core of a game represented by a bipolar MC-net is never empty, and that an imputation belonging to the CS-core can be computed in polynomial time.

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

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

M3 - Conference contribution

AN - SCOPUS:85046422727

VL - 1

SP - 308

EP - 316

BT - 16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017

PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)

ER -