Computational Complexity in Additive Hedonic Games
AbstractWe investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. Furthermore, the corresponding decision problems with respect to the existence of a Nash stable coalition structure and of an individually stable coalition structure turn out to be NP-complete in the strong sense.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Fondazione Eni Enrico Mattei in its series Working Papers with number 2008.98.
Date of creation: Dec 2008
Date of revision:
Additive Preferences; Coalition Formation; Computational Complexity; Hedonic Games; NP-hard; NP-complete;
Other versions of this item:
- Sung, Shao-Chin & Dimitrov, Dinko, 2010. "Computational complexity in additive hedonic games," European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
- Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- D02 - Microeconomics - - General - - - Institutions: Design, Formation, and Operations
- D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Tayfun Sönmez & Suryapratim Banerjee & Hideo Konishi, 2001.
"Core in a simple coalition formation game,"
Social Choice and Welfare,
Springer, vol. 18(1), pages 135-153.
- Koller, Daphne & Megiddo, Nimrod & von Stengel, Bernhard, 1996. "Efficient Computation of Equilibria for Extensive Two-Person Games," Games and Economic Behavior, Elsevier, vol. 14(2), pages 247-259, June.
- Dimitrov, D.A. & Borm, P.E.M. & Hendrickx, R.L.P. & Sung, S.C., 2006.
"Simple priorities and core stability in hedonic games,"
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-194178, Tilburg University.
- Dinko Dimitrov & Peter Borm & Ruud Hendrickx & Shao Sung, 2006. "Simple Priorities and Core Stability in Hedonic Games," Social Choice and Welfare, Springer, vol. 26(2), pages 421-433, April.
- Dinko Dimitrov & Peter Borm & Ruud Hendrickx & Shao Chin Sung, 2004. "Simple Priorities and Core Stability in Hedonic Games," Working Papers 2004.51, Fondazione Eni Enrico Mattei.
- Dinko Dimitrov & Peter Borm, 2004. "Simple Priorities and Core Stability in Hedonic Games," Econometric Society 2004 North American Summer Meetings 135, Econometric Society.
- Dimitrov, D.A. & Borm, P.E.M. & Hendrickx, R.L.P. & Sung, S.C., 2004. "Simple Priorities and Core Stability in Hedonic Games," Discussion Paper 2004-5, Tilburg University, Center for Economic Research.
- Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
- Itzhak Gilboa & Eitan Zemel, 1988.
"Nash and Correlated Equilibria: Some Complexity Considerations,"
777, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Gilboa, Itzhak & Zemel, Eitan, 1989. "Nash and correlated equilibria: Some complexity considerations," Games and Economic Behavior, Elsevier, vol. 1(1), pages 80-93, March.
- Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
- Gilboa, Itzhak, 1988. "The complexity of computing best-response automata in repeated games," Journal of Economic Theory, Elsevier, vol. 45(2), pages 342-352, August.
- Shao Chin Sung & Dinko Dimitrov, 2005. "On core membership testing for hedonic coalition formation games," Working Papers 374, Bielefeld University, Center for Mathematical Economics.
- Woeginger, Gerhard J., 2013. "A hardness result for core stability in additive hedonic games," Mathematical Social Sciences, Elsevier, vol. 65(2), pages 101-104.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (barbara racah).
If references are entirely missing, you can add them using this form.