Computational Complexity of Hedonic Games on Sparse Graphs

Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono

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

4 Citations (Scopus)


The additively separable hedonic game (ASHG) is a model of coalition formation games on graphs. In this paper, we intensively and extensively investigate the computational complexity of finding several desirable solutions, such as a Nash stable solution, a maximum utilitarian solution, and a maximum egalitarian solution in ASHGs on sparse graphs including bounded-degree graphs, bounded-treewidth graphs, and near-planar graphs. For example, we show that finding a maximum egalitarian solution is weakly NP-hard even on graphs of treewidth 2, whereas it can be solvable in polynomial time on trees. Moreover, we give a pseudo fixed parameter algorithm when parameterized by treewidth.

Original languageEnglish
Title of host publicationPRIMA 2019
Subtitle of host publicationPrinciples and Practice of Multi-Agent Systems - 22nd International Conference, Proceedings
EditorsMatteo Baldoni, Mehdi Dastani, Beishui Liao, Yuko Sakurai, Rym Zalila Wenkstern
Number of pages9
ISBN (Print)9783030337919
Publication statusPublished - 2019
Externally publishedYes
Event22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019 - Turin, Italy
Duration: Oct 28 2019Oct 31 2019

Publication series

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


Conference22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Computational Complexity of Hedonic Games on Sparse Graphs'. Together they form a unique fingerprint.

Cite this