Nash Stability in Additively Separable Hedonic Games and Community Structures

Authors:
Martin Olsen
Affiliations:
University of Aarhus, MADALGO, Department of Computer Science, Aabogade 34, 8200, Aarhus N, Denmark
Venue:
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
Year:
2009

Citing 0
Cited 6

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
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities

Information Processing Letters
Computing desirable partitions in additively separable hedonic games

Artificial Intelligence
Stable marriage and roommate problems with individual-based stability

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
On defining and computing communities

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the problem of deciding whether a Nash stable partition exists in an Additively Separable Hedonic Game is NP-complete. We also show that the problem of deciding whether a non trivial Nash stable partition exists in an Additively Separable Hedonic Game with non-negative and symmetric preferences is NP-complete. We motivate our study of the computational complexity by linking Nash stable partitions in Additively Separable Hedonic Games to community structures in networks. Our results formally justify that computing community structures in general is hard.