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

The core of games on k-regular set systems

Author

Listed:
  • Lijue Xie

    (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)

Abstract

In the classical setting of cooperative game theory, it is always assumed that all coalitions are feasible. However in many real situations, there are restrictions on the set of coalitions, for example duo to communication, order or hierarchy on the set of players, etc. There are already many works dealing with games on restricted set of coalitions, defining many different structures for the set of feasible coalitions, called set systems. We propose in this paper to consider k-regular set systems, that is, set systems having all maximal chains of the same length k. This is somehow related to communication graphs. We study in this perspective the core of games defined on k-regular set systems. We show that the core may be unbounded and without vertices in some situations.

Suggested Citation

  • Lijue Xie & Michel Grabisch, 2009. "The core of games on k-regular set systems," Post-Print halshs-00423922, HAL.
    • Handle: RePEc:hal:journl:halshs-00423922
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00423922v2
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00423922v2/document
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Hans Reijnierse & Jean Derks, 1998. "Note On the core of a collection of coalitions," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 451-459.
    2. Honda, Aoi & Grabisch, Michel, 2008. "An axiomatization of entropy of capacities on set systems," European Journal of Operational Research, Elsevier, vol. 190(2), pages 526-538, October.
    3. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    4. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 249-266.
    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. repec:hal:pseose:hal-00803233 is not listed on IDEAS
    2. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.

    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. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    2. Michel Grabisch, 2011. "Ensuring the boundedness of the core of games with restricted cooperation," Annals of Operations Research, Springer, vol. 191(1), pages 137-154, November.
    3. Michel Grabisch & Lijue Xie, 2008. "The core of games on distributive lattices: how to share benefits in a hierarchy," Post-Print halshs-00344802, HAL.
    4. Michel Grabisch & Lijue Xie, 2011. "The restricted core of games on distributive lattices: how to share benefits in a hierarchy," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 189-208, April.
    5. repec:hal:pseose:hal-00803233 is not listed on IDEAS
    6. Rene van den Brink & Ilya Katsev & Gerard van der Laan, 2023. "Properties of Solutions for Games on Union-Closed Systems," Mathematics, MDPI, vol. 11(4), pages 1-16, February.
    7. René Brink, 2017. "Games with a permission structure - A survey on generalizations and applications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 1-33, April.
    8. Michel Grabisch, 2015. "Fuzzy Measures and Integrals: Recent Developments," Post-Print hal-01302377, HAL.
    9. H. Andrew Michener & Daniel J. Myers, 1998. "Probabilistic Coalition Structure Theories," Journal of Conflict Resolution, Peace Science Society (International), vol. 42(6), pages 830-860, December.
    10. 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.
    11. László Á. Kóczy, 2016. "Power Indices When Players can Commit to Reject Coalitions," Homo Oeconomicus: Journal of Behavioral and Institutional Economics, Springer, vol. 33(1), pages 77-91, August.
    12. Sylvain Béal & Sylvain Ferrières & Philippe Solal, 2022. "The priority value for cooperative games with a priority structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(2), pages 431-450, June.
    13. Lange, Fabien & Grabisch, Michel, 2009. "Values on regular games under Kirchhoff's laws," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 322-340, November.
    14. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Discussion Paper 2011-100, Tilburg University, Center for Economic Research.
    15. Derks, Jean & Peters, Hans, 1997. "Consistent restricted Shapley values," Mathematical Social Sciences, Elsevier, vol. 33(1), pages 75-91, February.
    16. Pulido, Manuel A. & Sanchez-Soriano, Joaquin, 2006. "Characterization of the core in games with restricted cooperation," European Journal of Operational Research, Elsevier, vol. 175(2), pages 860-869, December.
    17. René van den Brink & Ilya Katsev & Gerard van der Laan, 2008. "An Algorithm for Computing the Nucleolus of Disjunctive Additive Games with An Acyclic Permission Structure," Tinbergen Institute Discussion Papers 08-104/1, Tinbergen Institute.
    18. van den Brink, René & Katsev, Ilya & van der Laan, Gerard, 2010. "An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure," European Journal of Operational Research, Elsevier, vol. 207(2), pages 817-826, December.
    19. Yoshio Kamijo, 2013. "The collective value: a new solution for games with coalition structures," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 572-589, October.
    20. Lei Li & Xueliang Li, 2011. "The covering values for acyclic digraph games," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(4), pages 697-718, November.
    21. Bilbao, J. M., 1998. "Axioms for the Shapley value on convex geometries," European Journal of Operational Research, Elsevier, vol. 110(2), pages 368-376, October.

    More about this item

    Keywords

    Cooperative game; feasible coalition; core; Jeu coopératif; coalition réalisable; coeur;
    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:journl:halshs-00423922. 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.