Nash Stability in Additively Separable Hedonic Games Is NP-Hard

Martin Olsen. Nash Stability in Additively Separable Hedonic Games Is NP-Hard. In S. Barry Cooper, Benedikt Löwe, Andrea Sorbi, editors, Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings. Volume 4497 of Lecture Notes in Computer Science, pages 598-605, Springer, 2007. [doi]

@inproceedings{Olsen07:0,
  title = {Nash Stability in Additively Separable Hedonic Games Is NP-Hard},
  author = {Martin Olsen},
  year = {2007},
  doi = {10.1007/978-3-540-73001-9_62},
  url = {http://dx.doi.org/10.1007/978-3-540-73001-9_62},
  researchr = {https://researchr.org/publication/Olsen07%3A0},
  cites = {0},
  citedby = {0},
  pages = {598-605},
  booktitle = {Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings},
  editor = {S. Barry Cooper and Benedikt Löwe and Andrea Sorbi},
  volume = {4497},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-73000-2},
}