Stable partitions with W-preferences
Discrete Applied Mathematics
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Local Search Algorithms for Core Checking in Hedonic Coalition Games
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Stochastic local search for core membership checking in hedonic games
Transactions on computational collective intelligence I
Stable partitions in additively separable hedonic games
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
An algorithm for generating nash stable coalition structures in hedonic games
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Computing desirable partitions in additively separable hedonic games
Artificial Intelligence
Hi-index | 0.00 |
We are concerned with the problem of core membership testing for hedonic coalition formation games, which is to decide whether a certain coalition structure belongs to the core of a given game. We show that this problem is co-NP complete when players' preferences are additive.