IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-02089363.html
   My bibliography  Save this paper

Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation

Author

Listed:
  • Vittorio Bilò

    (Dipartimento di Matematica Ennio De Giorgi - Università del Salento, Università del Salento [Lecce])

  • Angelo Fanelli

    (CREM - Centre de recherche en économie et management - UNICAEN - Université de Caen Normandie - NU - Normandie Université - UR - Université de Rennes - CNRS - Centre National de la Recherche Scientifique)

  • Michele Flammini

    (DISIM - Dipartimento di Ingegneria, Scienza dell'Informazione e Matematica - UNIVAQ - Università degli Studi dell'Aquila = University of L'Aquila, UNIVAQ - University of L'Aquila [Italy])

  • Gianpiero Monaco

    (DI - Dipartimento di Informatica [Italy] - UNIVAQ - Università degli Studi dell'Aquila = University of L'Aquila)

  • Luca Moscardelli

    (Department of Economic Studies - University of Chieti-Pescara, Dipartimento di Scienze - Universita di Chieti-Pescara - UNICH - Universita' degli Studi "G. d'Annunzio" Chieti-Pescara)

Abstract

We consider fractional hedonic games, a subclass of coalition formation games that can be succinctly modeled by means of a graph in which nodes represent agents and edge weights the degree of preference of the corresponding endpoints. The happiness or utility of an agent for being in a coalition is the average value she ascribes to its members. We adopt Nash stable outcomes as the target solution concept; that is we focus on states in which no agent can improve her utility by unilaterally changing her own group. We provide existence, efficiency and complexity results for games played on both general and specific graph topologies. As to the efficiency results, we mainly study the quality of the best Nash stable outcome and refer to the ratio between the social welfare of an optimal coalition structure and the one of such an equilibrium as to the price of stability. In this respect, we remark that a best Nash stable outcome has a natural meaning of stability, since it is the optimal solution among the ones which can be accepted by selfish agents. We provide upper and lower bounds on the price of stability for different topologies, both in case of weighted and unweighted edges. Beside the results for general graphs, we give refined bounds for various specific cases, such as triangle-free, bipartite graphs and tree graphs. For these families, we also show how to efficiently compute Nash stable outcomes with provable good social welfare.

Suggested Citation

  • Vittorio Bilò & Angelo Fanelli & Michele Flammini & Gianpiero Monaco & Luca Moscardelli, 2018. "Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation," Post-Print hal-02089363, HAL.
    • Handle: RePEc:hal:journl:hal-02089363
    DOI: 10.1613/jair.1.11211
    Note: View the original document on HAL open archive server: https://hal.science/hal-02089363
    as

    Download full text from publisher

    File URL: https://hal.science/hal-02089363/document
    Download Restriction: no
    File URL: https://libkey.io/10.1613/jair.1.11211?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Krzysztof R. Apt & Andreas Witzel, 2009. "A Generic Approach To Coalition Formation," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 11(03), pages 347-367.
    2. Francis Bloch & Effrosyni Diamantoudi, 2011. "Noncooperative formation of coalitions in hedonic games," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 263-280, May.
    3. Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
    4. Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
    5. Aziz, Haris & Brandt, Felix & Harrenstein, Paul, 2013. "Pareto optimality in coalition formation," Games and Economic Behavior, Elsevier, vol. 82(C), pages 562-581.
    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. Dreze, J H & Greenberg, J, 1980. "Hedonic Coalitions: Optimality and Stability," Econometrica, Econometric Society, vol. 48(4), pages 987-1003, May.
    8. Vittorio Bilò & Angelo Fanelli & Michele Flammini & Gianpiero Monaco & Luca Moscardelli, 2014. "Nash stability in fractional hedonic games," Post-Print hal-01103984, HAL.
    9. Xiaotie Deng & Christos H. Papadimitriou, 1994. "On the Complexity of Cooperative Solution Concepts," Mathematics of Operations Research, INFORMS, vol. 19(2), pages 257-266, 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. Edith Elkind & Angelo Fanelli & Michele Flammini, 2020. "Price of Pareto Optimality in hedonic games," Post-Print hal-02932135, HAL.
    2. Gianpiero Monaco & Luca Moscardelli & Yllka Velaj, 2021. "Additively Separable Hedonic Games with Social Context," Games, MDPI, vol. 12(3), pages 1-14, September.
    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.

    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. 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.
    3. Agnes Cseh & Tamas Fleiner & Petra Harjan, 2020. "Pareto optimal coalitions of fixed size," CERS-IE WORKING PAPERS 2005, Institute of Economics, Centre for Economic and Regional Studies.
    4. Gianpiero Monaco & Luca Moscardelli & Yllka Velaj, 2021. "Additively Separable Hedonic Games with Social Context," Games, MDPI, vol. 12(3), pages 1-14, September.
    5. Ágnes Cseh & Tamás Fleiner & Petra Harján, 2019. "Pareto Optimal Coalitions of Fixed Size," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 4(1), pages 87-108, November.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Dimitrov, Dinko & Lazarova, Emiliya A., 2008. "Coalitional Matchings," Coalition Theory Network Working Papers 37523, Fondazione Eni Enrico Mattei (FEEM).
    12. 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.
    13. Aziz, Haris & Brandt, Felix & Harrenstein, Paul, 2013. "Pareto optimality in coalition formation," Games and Economic Behavior, Elsevier, vol. 82(C), pages 562-581.
    14. Andreas Darmann & Edith Elkind & Sascha Kurz & Jérôme Lang & Joachim Schauer & Gerhard Woeginger, 2018. "Group activity selection problem with approval preferences," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(3), pages 767-796, September.
    15. Suksompong, Warut, 2015. "Individual and group stability in neutral restrictions of hedonic games," Mathematical Social Sciences, Elsevier, vol. 78(C), pages 1-5.
    16. 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.
    17. Karakaya, Mehmet, 2011. "Hedonic coalition formation games: A new stability notion," Mathematical Social Sciences, Elsevier, vol. 61(3), pages 157-165, May.
    18. Alison Watts, 2006. "Formation of Segregated and Integrated Groups," Working Papers 2006.127, Fondazione Eni Enrico Mattei.
    19. Niclas Boehmer & Edith Elkind, 2020. "Stable Roommate Problem with Diversity Preferences," Papers 2004.14640, arXiv.org.
    20. Duv{s}an Knop & v{S}imon Schierreich, 2023. "Host Community Respecting Refugee Housing," Papers 2302.13997, arXiv.org, revised Mar 2023.

    More about this item

    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:hal:journl:hal-02089363. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.