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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ballester, C.: NP-completeness in hedonic games. Games Econ. Behav. 49(1), 1–30 (2004)
Burani, N., Zwicker, W.S.: Coalition formation games with separable preferences. Math. Soc. Sci. 45(1), 27–52 (2003)
Cechlárová, K., Hajduková, J.: Computational complexity of stable partitions with b-preferences. Int. J. Game Theory 31(3), 353–364 (2002)
Cechlárová, K., Hajduková, J.: Stable partitions with w-preferences. Discrete Appl. Math. 138(3), 333–347 (2004)
Chen, N., Rudra, A.: Walrasian equilibrium: Hardness, approximations and tractable instances. In: WINE, pp. 141–150 (2005)
Daskalakis, K., Papadimitriou, C.H.: The complexity of games on highly regular graphs. In: ESA, pp. 71–82 (2005)
Duch, J., Danon, L., Díaz-Guilera, A., Arenas, A.: Comparing community structure identification. J. Stat. Mech. Theory Exp. 2005(09), 09008 (2005)
Flake, G., Tarjan, R., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Math. 1(4), 385–408 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Hajdukova, J.: On coalition formation games. Technical Report, Institute of Mathematics, PJ Safarik University (2004)
Jackson, M.O., Bogomolnaia, A.: The stability of hedonic coalition structures. Games Econ. Behav. 38(2), 201–230 (2002)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)
Sung, S.C., Dimitrov, D.: On core membership testing for hedonic coalition formation games. Oper. Res. Lett. 35(2), 155–158 (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
The research is partly sponsored by the company Cofman (www.cofman.com).
Rights and permissions
About this article
Cite this article
Olsen, M. Nash Stability in Additively Separable Hedonic Games and Community Structures. Theory Comput Syst 45, 917–925 (2009). https://doi.org/10.1007/s00224-009-9176-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-009-9176-8