External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Computational Complexity of Hedonic Games on Sparse Graphs

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]

Authors

Tesshu Hanaka

This author has not been identified. Look up 'Tesshu Hanaka' in Google

Hironori Kiya

This author has not been identified. Look up 'Hironori Kiya' in Google

Yasuhide Maei

This author has not been identified. Look up 'Yasuhide Maei' in Google

Hirotaka Ono

This author has not been identified. Look up 'Hirotaka Ono' in Google
runs on