Two hardness results for core stability in hedonic coalition formation games |
| |
| Authors: | Vladimir G. Deineko Gerhard J. Woeginger |
| |
| Affiliation: | 1. Warwick Business School, The University of Warwick, Coventry CV4 7AL, United Kingdom;2. Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands |
| |
| 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: | Computational social choice Computational complexity Coalition formation Hedonic game |
| 本文献已被 ScienceDirect 等数据库收录！ |
