TY - GEN
T1 - Computational Complexity of Hedonic Games on Sparse Graphs
AU - Hanaka, Tesshu
AU - Kiya, Hironori
AU - Maei, Yasuhide
AU - Ono, Hirotaka
N1 - Funding Information:
A full version of the paper is available in [13]. This work was partially supported by JSPS KAKENHI Grant Numbers JP17K19960, 17H01698, 19K21537.
Publisher Copyright:
© 2019, Springer Nature Switzerland AG.
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85076393259&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85076393259&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-33792-6_43
DO - 10.1007/978-3-030-33792-6_43
M3 - Conference contribution
AN - SCOPUS:85076393259
SN - 9783030337919
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 576
EP - 584
BT - PRIMA 2019
A2 - Baldoni, Matteo
A2 - Dastani, Mehdi
A2 - Liao, Beishui
A2 - Sakurai, Yuko
A2 - Zalila Wenkstern, Rym
PB - Springer
T2 - 22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019
Y2 - 28 October 2019 through 31 October 2019
ER -