A hardness result for core stability in additive hedonic games

Research output: Contribution to journalArticleAcademicpeer-review

27 Citations (Scopus)

Abstract

We investigate the computational complexity of a decision problem in hedonic coalition formation games. We prove that core stability in additive hedonic games is complete for the second level of the polynomial hierarchy.
Original languageEnglish
Pages (from-to)101-104
JournalMathematical Social Sciences
Volume65
Issue number2
DOIs
Publication statusPublished - 2013

Fingerprint

Dive into the research topics of 'A hardness result for core stability in additive hedonic games'. Together they form a unique fingerprint.

Cite this