Article ID Journal Published Year Pages File Type
419597 Discrete Applied Mathematics 2013 6 Pages PDF
Abstract

We establish NP-completeness of two problems on core stable coalitions in hedonic games. In the first problem every player has only two acceptable coalitions in his preference list, and in the second problem the preference structures arise from the distances in an underlying metric space.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Two hardness results for core stability in hedonic coalition formation games
Authors
, ,