Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono. Computational Complexity of Hedonic Games on Sparse Graphs. In Matteo Baldoni, Mehdi Dastani, Beishui Liao, Yuko Sakurai, Rym Zalila-Wenkstern, editors, PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference, Turin, Italy, October 28-31, 2019, Proceedings. Volume 11873 of Lecture Notes in Computer Science, pages 576-584, Springer, 2019. [doi]
@inproceedings{HanakaKMO19,
title = {Computational Complexity of Hedonic Games on Sparse Graphs},
author = {Tesshu Hanaka and Hironori Kiya and Yasuhide Maei and Hirotaka Ono},
year = {2019},
doi = {10.1007/978-3-030-33792-6_43},
url = {https://doi.org/10.1007/978-3-030-33792-6_43},
researchr = {https://researchr.org/publication/HanakaKMO19},
cites = {0},
citedby = {0},
pages = {576-584},
booktitle = {PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference, Turin, Italy, October 28-31, 2019, Proceedings},
editor = {Matteo Baldoni and Mehdi Dastani and Beishui Liao and Yuko Sakurai and Rym Zalila-Wenkstern},
volume = {11873},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-33792-6},
}