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

Minimal balanced collections and their application to core stability and other topics of game theory

Author

Listed:
  • Dylan Laplace Mermoud

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - 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)

  • Peter Sudhölter

    (SDU - University of Southern Denmark)

Abstract

Minimal balanced collections are a generalization of partitions of a finite set of n elements and have important applications in cooperative game theory and discrete mathematics. However, their number is not known beyond n = 4. In this paper we investigate the problem of generating minimal balanced collections and implement the Peleg algorithm, permitting to generate all minimal balanced collections till n = 7. Secondly, we provide practical algorithms to check many properties of coalitions and games, based on minimal balanced collections, in a way which is faster than linear programming-based methods. In particular, we construct an algorithm to check if the core of a cooperative game is a stable set in the sense of von Neumann and Morgenstern. The algorithm implements a theorem according to which the core is a stable set if and only if a certain nested balancedness condition is valid. The second level of this condition requires generalizing the notion of balanced collection to balanced sets.

Suggested Citation

  • Dylan Laplace Mermoud & Michel Grabisch & Peter Sudhölter, 2023. "Minimal balanced collections and their application to core stability and other topics of game theory," Post-Print halshs-04356803, HAL.
  • Handle: RePEc:hal:journl:halshs-04356803
    DOI: 10.1016/j.dam.2023.07.025
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-04356803
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.dam.2023.07.025?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:

    Citations

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


    Cited by:

    1. Michel Grabisch & Hervé Moulin & José Manuel Zarzuelo, 2024. "Professor Peter Sudhölter (1957–2024)," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(2), pages 289-294, June.

    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:halshs-04356803. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.