Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation

Aolong Zha, Kazuki Nomoto, Suguru Ueda, Miyuki Koshimura, Yuko Sakurai, Makoto Yokoo

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

1 Citation (Scopus)

Abstract

Coalition Structure Generation (CSG), a main research issue in the domain of coalition games, involves partitioning agents into exhaustive and disjoint coalitions to optimize the social welfare. The advent of compact representation schemes, such as Partition Decision Trees (PDTs), promotes the efficiency of solving CSG problems. This paper studies the CSG problem for partition function games (PFGs) which are coalitional games with externalities. In PFGs, each value of a coalition depends on how the other agents are partitioned. We apply PDTs to represent PFGs and present two methods to solve CSG problems: a depth-first branch-and-bound algorithm and MaxSAT encoding.

Original languageEnglish
Title of host publicationPRIMA 2017
Subtitle of host publicationPrinciples and Practice of Multi-Agent Systems - 20th International Conference, Proceedings
EditorsAna Bazzan, Serena Villata, Bo An, Joao Leite, Leendert van der Torre
PublisherSpringer Verlag
Pages143-159
Number of pages17
ISBN (Print)9783319691305
DOIs
Publication statusPublished - Jan 1 2017
Event20th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2017 - Nice, France
Duration: Oct 30 2017Nov 3 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10621 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other20th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2017
CountryFrance
CityNice
Period10/30/1711/3/17

Fingerprint

Graphical Representation
Coalitions
Partition Function
Game
Decision trees
Decision tree
Partition
Coalitional Games
Externalities
Branch and Bound Algorithm
Welfare
Partitioning
Disjoint
Encoding
Optimise

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Zha, A., Nomoto, K., Ueda, S., Koshimura, M., Sakurai, Y., & Yokoo, M. (2017). Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation. In A. Bazzan, S. Villata, B. An, J. Leite, & L. van der Torre (Eds.), PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings (pp. 143-159). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10621 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-319-69131-2_9

Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation. / Zha, Aolong; Nomoto, Kazuki; Ueda, Suguru; Koshimura, Miyuki; Sakurai, Yuko; Yokoo, Makoto.

PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings. ed. / Ana Bazzan; Serena Villata; Bo An; Joao Leite; Leendert van der Torre. Springer Verlag, 2017. p. 143-159 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10621 LNAI).

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

Zha, A, Nomoto, K, Ueda, S, Koshimura, M, Sakurai, Y & Yokoo, M 2017, Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation. in A Bazzan, S Villata, B An, J Leite & L van der Torre (eds), PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10621 LNAI, Springer Verlag, pp. 143-159, 20th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2017, Nice, France, 10/30/17. https://doi.org/10.1007/978-3-319-69131-2_9
Zha A, Nomoto K, Ueda S, Koshimura M, Sakurai Y, Yokoo M. Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation. In Bazzan A, Villata S, An B, Leite J, van der Torre L, editors, PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings. Springer Verlag. 2017. p. 143-159. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-69131-2_9
Zha, Aolong ; Nomoto, Kazuki ; Ueda, Suguru ; Koshimura, Miyuki ; Sakurai, Yuko ; Yokoo, Makoto. / Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation. PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings. editor / Ana Bazzan ; Serena Villata ; Bo An ; Joao Leite ; Leendert van der Torre. Springer Verlag, 2017. pp. 143-159 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{749dfaa773b94a07bf6c2e982cc5211f,
title = "Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation",
abstract = "Coalition Structure Generation (CSG), a main research issue in the domain of coalition games, involves partitioning agents into exhaustive and disjoint coalitions to optimize the social welfare. The advent of compact representation schemes, such as Partition Decision Trees (PDTs), promotes the efficiency of solving CSG problems. This paper studies the CSG problem for partition function games (PFGs) which are coalitional games with externalities. In PFGs, each value of a coalition depends on how the other agents are partitioned. We apply PDTs to represent PFGs and present two methods to solve CSG problems: a depth-first branch-and-bound algorithm and MaxSAT encoding.",
author = "Aolong Zha and Kazuki Nomoto and Suguru Ueda and Miyuki Koshimura and Yuko Sakurai and Makoto Yokoo",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-69131-2_9",
language = "English",
isbn = "9783319691305",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "143--159",
editor = "Ana Bazzan and Serena Villata and Bo An and Joao Leite and {van der Torre}, Leendert",
booktitle = "PRIMA 2017",
address = "Germany",

}

TY - GEN

T1 - Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation

AU - Zha, Aolong

AU - Nomoto, Kazuki

AU - Ueda, Suguru

AU - Koshimura, Miyuki

AU - Sakurai, Yuko

AU - Yokoo, Makoto

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Coalition Structure Generation (CSG), a main research issue in the domain of coalition games, involves partitioning agents into exhaustive and disjoint coalitions to optimize the social welfare. The advent of compact representation schemes, such as Partition Decision Trees (PDTs), promotes the efficiency of solving CSG problems. This paper studies the CSG problem for partition function games (PFGs) which are coalitional games with externalities. In PFGs, each value of a coalition depends on how the other agents are partitioned. We apply PDTs to represent PFGs and present two methods to solve CSG problems: a depth-first branch-and-bound algorithm and MaxSAT encoding.

AB - Coalition Structure Generation (CSG), a main research issue in the domain of coalition games, involves partitioning agents into exhaustive and disjoint coalitions to optimize the social welfare. The advent of compact representation schemes, such as Partition Decision Trees (PDTs), promotes the efficiency of solving CSG problems. This paper studies the CSG problem for partition function games (PFGs) which are coalitional games with externalities. In PFGs, each value of a coalition depends on how the other agents are partitioned. We apply PDTs to represent PFGs and present two methods to solve CSG problems: a depth-first branch-and-bound algorithm and MaxSAT encoding.

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

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

U2 - 10.1007/978-3-319-69131-2_9

DO - 10.1007/978-3-319-69131-2_9

M3 - Conference contribution

AN - SCOPUS:85034243794

SN - 9783319691305

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 143

EP - 159

BT - PRIMA 2017

A2 - Bazzan, Ana

A2 - Villata, Serena

A2 - An, Bo

A2 - Leite, Joao

A2 - van der Torre, Leendert

PB - Springer Verlag

ER -