Computational Complexity in Additive Hedonic Games
We 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.
|Date of creation:||Dec 2008|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.feem.it/
More information through EDIRC
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.:
- Dimitrov, D.A. & Borm, P.E.M. & Hendrickx, R.L.P. & Sung, S.C., 2004.
"Simple Priorities and Core Stability in Hedonic Games,"
2004-5, Tilburg University, Center for Economic Research.
- 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.
- Dimitrov, D.A. & Borm, P.E.M. & Hendrickx, R.L.P. & Sung, S.C., 2006. "Simple priorities and core stability in hedonic games," Other publications TiSEM 7c737a30-ac86-46ed-b210-e, Tilburg University, School of Economics and Management.
- Dinko Dimitrov & Peter Borm, 2004. "Simple Priorities and Core Stability in Hedonic Games," Econometric Society 2004 North American Summer Meetings 135, Econometric Society.
- 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.
- 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.
- Suryapratim Banerjee & Hideo Konishi & Tayfun Sonmez, 1999.
"Core in a Simple Coalition Formation Game,"
Boston College Working Papers in Economics
449, Boston College Department of Economics.
- Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
- Shao Chin Sung & Dinko Dimitrov, 2005. "On core membership testing for hedonic coalition formation games," Center for Mathematical Economics Working Papers 374, Center for Mathematical Economics, Bielefeld University.
- 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.
- 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.
- Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
When requesting a correction, please mention this item's handle: RePEc:fem:femwpa:2008.98. See general information about how to correct material in RePEc.
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.