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

Preserving coalitional rationality for non-balanced games

Author

Listed:
  • Stéphane Gonzalez

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, UJM - Université Jean Monnet - Saint-Étienne, GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - UL2 - Université Lumière - Lyon 2 - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - UJM - Université Jean Monnet - Saint-Étienne - CNRS - Centre National de la Recherche Scientifique)

  • Michel Grabisch

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

Abstract

In cooperative games, the core is one of the most popular solution concept since it ensures coalitional rationality. For non-balanced games however, the core is empty, and other solution concepts have to be found. We propose the use of general solutions, that is, to distribute the total worth of the game among groups rather than among individuals. In particular, the k-additive core proposed by Grabisch and Miranda is a general solution preserving coalitional rationality which distributes among coalitions of size at most k, and is never empty for k ≥ 2. The extended core of Bejan and Gomez can also be viewed as a general solution, since it implies to give an amount to the grand coalition. The k-additive core being an unbounded set and therefore difficult to use in practice, we propose a subset of it called the minimal negotiation set. The idea is to select elements of the k-additive core mimimizing the total amount given to coalitions of size greater than 1. Thus the minimum negotiation set naturally reduces to the core for balanced games. We study this set, giving properties and axiomatizations, as well as its relation to the extended core of Bejan and Gomez. We give a method of computing the minimum bargaining set, and lastly indicate how to eventually get classical solutions from general ones.

Suggested Citation

  • Stéphane Gonzalez & Michel Grabisch, 2015. "Preserving coalitional rationality for non-balanced games," PSE-Ecole d'économie de Paris (Postprint) halshs-01235625, HAL.
  • Handle: RePEc:hal:pseptp:halshs-01235625
    DOI: 10.1007/s00182-014-0451-9
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-01235625
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-01235625/document
    Download Restriction: no

    File URL: https://libkey.io/10.1007/s00182-014-0451-9?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
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Grabisch, Michel & Li, Tong, 2011. "On the set of imputations induced by the k-additive core," European Journal of Operational Research, Elsevier, vol. 214(3), pages 697-702, November.
    2. Miranda, Pedro & Grabisch, Michel, 2010. "k-Balanced games and capacities," European Journal of Operational Research, Elsevier, vol. 200(2), pages 465-472, January.
    3. Michel Grabisch & Pedro Miranda, 2008. "On the vertices of the k-additive core," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00321625, HAL.
    4. Chateauneuf, Alain & Jaffray, Jean-Yves, 1989. "Some characterizations of lower probabilities and other monotone capacities through the use of Mobius inversion," Mathematical Social Sciences, Elsevier, vol. 17(3), pages 263-283, June.
    5. Thomson, William, 2003. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey," Mathematical Social Sciences, Elsevier, vol. 45(3), pages 249-297, July.
    6. Aumann, Robert J. & Maschler, Michael, 1985. "Game theoretic analysis of a bankruptcy problem from the Talmud," Journal of Economic Theory, Elsevier, vol. 36(2), pages 195-213, August.
    7. Bezalel Peleg & Peter Sudhölter, 2007. "Introduction to the Theory of Cooperative Games," Theory and Decision Library C, Springer, edition 0, number 978-3-540-72945-7, March.
    8. Jean Derks & Hans Haller & Hans Peters, 2000. "The selectope for cooperative games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(1), pages 23-38.
    9. Camelia Bejan & Juan Gómez, 2009. "Core extensions for non-balanced TU-games," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(1), pages 3-16, March.
    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. Gonzalez, Stéphane & Grabisch, Michel, 2016. "Multicoalitional solutions," Journal of Mathematical Economics, Elsevier, vol. 64(C), pages 1-10.
    2. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games and capacities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 301-326, July.
    3. Stéphane Gonzalez & Michel Grabisch, 2015. "Autonomous coalitions," Annals of Operations Research, Springer, vol. 235(1), pages 301-317, December.
    4. Jean Derks & Hans Peters & Peter Sudhölter, 2014. "On extensions of the core and the anticore of transferable utility games," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(1), pages 37-63, February.
    5. Stéphane Gonzalez & Aymeric Lardon, 2018. "Optimal deterrence of cooperation," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 207-227, March.
    6. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games," Documents de travail du Centre d'Economie de la Sorbonne 16081, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    7. repec:hal:pseose:halshs-01235632 is not listed on IDEAS
    8. repec:hal:pseose:halshs-00881108 is not listed on IDEAS
    9. Michel Grabisch, 2016. "Rejoinder on: Remarkable polyhedra related to set functions, games and capacities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 335-337, July.
    10. repec:hal:pseose:hal-01372858 is not listed on IDEAS
    11. Michel Grabisch, 2016. "Rejoinder on: Remarkable polyhedra related to set functions, games and capacities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 335-337, July.

    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. repec:hal:pseose:halshs-01235625 is not listed on IDEAS
    2. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games and capacities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 301-326, July.
    3. Grabisch, Michel & Li, Tong, 2011. "On the set of imputations induced by the k-additive core," European Journal of Operational Research, Elsevier, vol. 214(3), pages 697-702, November.
    4. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games," Documents de travail du Centre d'Economie de la Sorbonne 16081, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    5. repec:hal:pseose:hal-01372858 is not listed on IDEAS
    6. Pedro Miranda & Michel Grabisch, 2012. "An algorithm for finding the vertices of the k-additive monotone core," Post-Print hal-00806905, HAL.
    7. Peter Knudsen & Lars Østerdal, 2012. "Merging and splitting in cooperative games: some (im)possibility results," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(4), pages 763-774, November.
    8. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    9. Jingyi Xue, 2018. "Fair division with uncertain needs," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(1), pages 105-136, June.
    10. Pálvölgyi, Dénes & Peters, Hans & Vermeulen, Dries, 2014. "A strategic approach to multiple estate division problems," Games and Economic Behavior, Elsevier, vol. 88(C), pages 135-152.
    11. Jens Leth Hougaard & Juan D. Moreno-Ternero & Lars Peter Østerdal, 2010. "Baseline Rationing," Discussion Papers 10-16, University of Copenhagen. Department of Economics.
    12. José-Manuel Giménez-Gómez & António Osório & Josep E. Peris, 2015. "From Bargaining Solutions to Claims Rules: A Proportional Approach," Games, MDPI, vol. 6(1), pages 1-7, March.
    13. Arantza Estévez-Fernández & Peter Borm & M. Gloria Fiestras-Janeiro, 2020. "Nontransferable utility bankruptcy games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 154-177, April.
    14. Peris, Josep E. & Jiménez-Gómez, José M., 2012. "A Proportional Approach to Bankruptcy Problems with a guaranteed minimum," QM&ET Working Papers 12-7, University of Alicante, D. Quantitative Methods and Economic Theory.
    15. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2012. "A unifying framework for the problem of adjudicating conflicting claims," Journal of Mathematical Economics, Elsevier, vol. 48(2), pages 107-114.
    16. Carlos González-Alcón & Peter Borm & Ruud Hendrickx, 2007. "A composite run-to-the-bank rule for multi-issue allocation situations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(2), pages 339-352, April.
    17. William Thomson, 2011. "Consistency and its converse: an introduction," Review of Economic Design, Springer;Society for Economic Design, vol. 15(4), pages 257-291, December.
    18. Gabrielle Demange, 2021. "On the resolution of cross-liabilities," PSE Working Papers halshs-03151128, HAL.
    19. William Thomson, 2014. "Compromising between the proportional and constrained equal awards rules," RCER Working Papers 584, University of Rochester - Center for Economic Research (RCER).
    20. Boonen, Tim J., 2019. "Equilibrium recoveries in insurance markets with limited liability," Journal of Mathematical Economics, Elsevier, vol. 85(C), pages 38-45.
    21. José M. Jiménez Gómez, 2010. "Noncooperative justifications for old bankruptcy rules," Working Papers. Serie AD 2010-15, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
    22. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2020. "On the difficulty of budget allocation in claims problems with indivisible items of different prices," ThE Papers 20/09, Department of Economic Theory and Economic History of the University of Granada..

    More about this item

    Keywords

    core; general solution; balancedness; cooperative game;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:pseptp:halshs-01235625. 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: Caroline Bauer (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.