IDEAS home Printed from https://ideas.repec.org/p/lmu/muenec/6430.html
   My bibliography  Save this paper

Computational Complexity in Additive Hedonic Games

Author

Listed:
  • Sung, Shao-Chin
  • Dimitrov, Dinko

Abstract

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.

Suggested Citation

  • Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
    • Handle: RePEc:lmu:muenec:6430
    as

    Download full text from publisher

    File URL: https://epub.ub.uni-muenchen.de/6430/1/Complexity.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Dinko Dimitrov & Peter Borm & Ruud Hendrickx & Shao Sung, 2006. "Simple Priorities and Core Stability in Hedonic Games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 26(2), pages 421-433, April.
    2. Ben-porath, Elchanan, 1990. "The complexity of computing a best response automaton in repeated games with mixed strategies," Games and Economic Behavior, Elsevier, vol. 2(1), pages 1-12, March.
    3. Gilboa, Itzhak & Zemel, Eitan, 1989. "Nash and correlated equilibria: Some complexity considerations," Games and Economic Behavior, Elsevier, vol. 1(1), pages 80-93, March.
    4. Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
    5. Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
    6. Tayfun Sönmez & Suryapratim Banerjee & Hideo Konishi, 2001. "Core in a simple coalition formation game," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(1), pages 135-153.
    7. Richard Baron & Jacques Durieu & Hans Haller & Rahul Savani & Philippe Solal, 2008. "Good neighbors are hard to find: computational complexity of network formation," Review of Economic Design, Springer;Society for Economic Design, vol. 12(1), pages 1-19, April.
    8. Jeroen Kuipers & Ulrich Faigle & Walter Kern, 1998. "Note Computing the nucleolus of min-cost spanning tree games is NP-hard," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 443-450.
    9. 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.
    10. 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.
    11. Ulrich Faigle & Walter Kern & Winfried Hochstättler & Sándor P. Fekete, 1997. "On the Complexity of Testing Membership in the Core of Min-Cost Spanning Tree Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 26(3), pages 361-366.
    12. 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.
    13. Koller, Daphne & Megiddo, Nimrod, 1992. "The complexity of two-person zero-sum games in extensive form," Games and Economic Behavior, Elsevier, vol. 4(4), pages 528-552, October.
    14. Sung, Shao Chin & Dimitrov, Dinko, 2011. "On core membership testing for hedonic coalition formation games," Center for Mathematical Economics Working Papers 374, Center for Mathematical Economics, Bielefeld University.
    15. Shao Sung & Dinko Dimitrov, 2007. "On Myopic Stability Concepts for Hedonic Games," Theory and Decision, Springer, vol. 62(1), pages 31-45, February.
    16. Dreze, J H & Greenberg, J, 1980. "Hedonic Coalitions: Optimality and Stability," Econometrica, Econometric Society, vol. 48(4), pages 987-1003, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. Alcalde-Unzu, Jorge & Gallo, Oihane & Inarra, Elena & Moreno-Ternero, Juan D., 2024. "Solidarity to achieve stability," European Journal of Operational Research, Elsevier, vol. 315(1), pages 368-377.
    3. Martin Gairing & Rahul Savani, 2019. "Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1101-1121, August.
    4. Rothe, Jörg & Schadrack, Hilmar & Schend, Lena, 2018. "Borda-induced hedonic games with friends, enemies, and neutral players," Mathematical Social Sciences, Elsevier, vol. 96(C), pages 21-36.
    5. Woeginger, Gerhard J., 2013. "A hardness result for core stability in additive hedonic games," Mathematical Social Sciences, Elsevier, vol. 65(2), pages 101-104.
    6. Gianpiero Monaco & Luca Moscardelli & Yllka Velaj, 2021. "Additively Separable Hedonic Games with Social Context," Games, MDPI, vol. 12(3), pages 1-14, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Martin Gairing & Rahul Savani, 2019. "Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1101-1121, August.
    2. Woeginger, Gerhard J., 2013. "A hardness result for core stability in additive hedonic games," Mathematical Social Sciences, Elsevier, vol. 65(2), pages 101-104.
    3. Karakaya, Mehmet, 2011. "Hedonic coalition formation games: A new stability notion," Mathematical Social Sciences, Elsevier, vol. 61(3), pages 157-165, May.
    4. Dinko Dimitrov & Peter Borm & Ruud Hendrickx & Shao Sung, 2006. "Simple Priorities and Core Stability in Hedonic Games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 26(2), pages 421-433, April.
    5. Sheida Etemadidavan & Andrew J. Collins, 2021. "An Empirical Distribution of the Number of Subsets in the Core Partitions of Hedonic Games," SN Operations Research Forum, Springer, vol. 2(4), pages 1-20, December.
    6. Alison Watts, 2007. "Formation of segregated and integrated groups," International Journal of Game Theory, Springer;Game Theory Society, vol. 35(4), pages 505-519, April.
    7. Iehle, Vincent, 2007. "The core-partition of a hedonic game," Mathematical Social Sciences, Elsevier, vol. 54(2), pages 176-185, September.
    8. Mehmet Karakaya & Bettina Klaus, 2017. "Hedonic coalition formation games with variable populations: core characterizations and (im)possibilities," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(2), pages 435-455, May.
    9. Suksompong, Warut, 2015. "Individual and group stability in neutral restrictions of hedonic games," Mathematical Social Sciences, Elsevier, vol. 78(C), pages 1-5.
    10. Dimitrov, D.A. & Sung, S.C., 2004. "Enemies and Friends in Hedonic Games : Individual Deviations, Stability and Manipulation," Discussion Paper 2004-111, Tilburg University, Center for Economic Research.
    11. Alison Watts, 2006. "Formation of Segregated and Integrated Groups," Working Papers 2006.127, Fondazione Eni Enrico Mattei.
    12. Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
    13. Andrew J. Collins & Sheida Etemadidavan & Wael Khallouli, 2020. "Generating Empirical Core Size Distributions of Hedonic Games using a Monte Carlo Method," Papers 2007.12127, arXiv.org.
    14. Rothe, Jörg & Schadrack, Hilmar & Schend, Lena, 2018. "Borda-induced hedonic games with friends, enemies, and neutral players," Mathematical Social Sciences, Elsevier, vol. 96(C), pages 21-36.
    15. Gianpiero Monaco & Luca Moscardelli & Yllka Velaj, 2021. "Additively Separable Hedonic Games with Social Context," Games, MDPI, vol. 12(3), pages 1-14, September.
    16. Shao Sung & Dinko Dimitrov, 2007. "On Myopic Stability Concepts for Hedonic Games," Theory and Decision, Springer, vol. 62(1), pages 31-45, February.
    17. Sung, Shao Chin & Dimitrov, Dinko, 2006. "A Taxonomy of Myopic Stability Concepts for Hedonic Games," Coalition Theory Network Working Papers 12168, Fondazione Eni Enrico Mattei (FEEM).
    18. Aziz, Haris & Brandt, Felix & Harrenstein, Paul, 2013. "Pareto optimality in coalition formation," Games and Economic Behavior, Elsevier, vol. 82(C), pages 562-581.
    19. Alcalde-Unzu, Jorge & Gallo, Oihane & Inarra, Elena & Moreno-Ternero, Juan D., 2024. "Solidarity to achieve stability," European Journal of Operational Research, Elsevier, vol. 315(1), pages 368-377.
    20. Darmann, Andreas, 2018. "A social choice approach to ordinal group activity selection," Mathematical Social Sciences, Elsevier, vol. 93(C), pages 57-66.

    More about this item

    Keywords

    additive preferences; coalition formation; computational complexity; hedonic games; NP-hard; NP-complete;
    All these keywords.

    JEL classification:

    • 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

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:lmu:muenec:6430. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tamilla Benkelberg (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.