IDEAS home Printed from https://ideas.repec.org/p/unm/umagsb/2026008.html

Two-bound core games with communication restrictions

Author

Listed:
  • Chai, Ziyi
  • Dietzenbacher, Bas

    (RS: GSBE other - not theme-related research, QE Math. Economics & Game Theory)

Abstract

This paper studies classes of two-bound core games with communication restrictions modeled by an undirected graph. We focus on unanimity games, bankruptcy games, 1-convex games, big boss games, clan games, compromise stable games, one-bound core games, and the entire class of two-bound core games. For each of these classes, we characterize all communication graphs that guarantee that the graph-restricted game belongs to the same class as the original two-bound core game.

Suggested Citation

  • Chai, Ziyi & Dietzenbacher, Bas, 2026. "Two-bound core games with communication restrictions," Research Memorandum 008, Maastricht University, Graduate School of Business and Economics (GSBE).
    • Handle: RePEc:unm:umagsb:2026008
    DOI: 10.26481/umagsb.2026008
    as

    Download full text from publisher

    File URL: https://cris.maastrichtuniversity.nl/ws/files/323027936/RM26008.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.26481/umagsb.2026008?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. Alexandre Skoda & Xavier Venel, 2025. "Inheritance of weighted average-convexity in communication situations," International Journal of Game Theory, Springer;Game Theory Society, vol. 54(1), pages 1-33, June.
    2. Marco Slikker, 2000. "Inheritance of properties in communication situations," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(2), pages 241-268.
    3. Lloyd S. Shapley, 1967. "On balanced sets and cores," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 14(4), pages 453-460.
    4. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    5. Marieke Quant & Peter Borm & Hans Reijnierse & Bas van Velzen, 2005. "The core cover in relation to the nucleolus and the Weber set," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(4), pages 491-503, November.
    6. J. Schouten & B. Dietzenbacher & P. Borm, 2022. "The nucleolus and inheritance of properties in communication situations," Annals of Operations Research, Springer, vol. 318(2), pages 1117-1135, November.
    7. Miguel Ángel Mirás Calvo & Iago Núñez Lugilde & Carmen Quinteiro Sandomingo & Estela Sánchez-Rodríguez, 2024. "An algorithm to compute the average-of-awards rule for claims problems with an application to the allocation of CO $$_2$$ 2 emissions," Annals of Operations Research, Springer, vol. 336(3), pages 1435-1459, May.
    8. van den Nouweland, Anne & Borm, Peter, 1991. "On the Convexity of Communication Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 19(4), pages 421-430.
    9. 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).
    10. Bas Dietzenbacher & Dries Vermeulen, 2026. "Graph-restricted games and their inheritance of properties," International Journal of Game Theory, Springer;Game Theory Society, vol. 55(1), pages 1-16, June.
    Full references (including those not matched with items on IDEAS)

    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. Schouten, Jop, 2022. "Cooperation, allocation and strategy in interactive decision-making," Other publications TiSEM d5d41448-8033-4f6b-8ec0-c, Tilburg University, School of Economics and Management.
    2. J. Schouten & B. Dietzenbacher & P. Borm, 2022. "The nucleolus and inheritance of properties in communication situations," Annals of Operations Research, Springer, vol. 318(2), pages 1117-1135, November.
    3. Bas Dietzenbacher & Dries Vermeulen, 2026. "Graph-restricted games and their inheritance of properties," International Journal of Game Theory, Springer;Game Theory Society, vol. 55(1), pages 1-16, June.
    4. Alexandre Skoda & Xavier Venel, 2025. "Inheritance of weighted average-convexity in communication situations," International Journal of Game Theory, Springer;Game Theory Society, vol. 54(1), pages 1-33, June.
    5. Alexandre Skoda, 2020. "Inheritance of Convexity for the P˜min-Restricted Game," Post-Print halshs-02967120, HAL.
    6. Doudou Gong & Bas Dietzenbacher & Hans Peters, 2024. "Two-bound core games and the nucleolus," Annals of Operations Research, Springer, vol. 336(3), pages 1419-1433, May.
    7. 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.
    8. Alexandre Skoda, 2020. "Inheritance of Convexity for the P˜min-Restricted Game," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-02967120, HAL.
    9. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    10. A. Skoda, 2021. "Inheritance of convexity for the $$\mathcal {P}_{\min }$$ P min -restricted game," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 1-32, February.
    11. Alexandre Skoda, 2020. "Inheritance of Convexity for the Pmin-Restricted Game," Documents de travail du Centre d'Economie de la Sorbonne 20020, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    12. Yushuang Mou & Wensheng Jia & Qiang Sun & Chao Zhang, 2025. "On Compromised Value for Cooperative Games with Graph Communication Structures," Journal of Optimization Theory and Applications, Springer, vol. 207(2), pages 1-18, November.
    13. Iago Núñez Lugilde & Arantza Estévez-Fernández & Estela Sánchez-Rodríguez, 2024. "Priority coalitional games and claims problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(3), pages 669-701, December.
    14. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Documents de travail du Centre d'Economie de la Sorbonne 16019, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    15. 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.
    16. Gonzalez, Stéphane & Rostom, Fatma Zahra, 2022. "Sharing the global outcomes of finite natural resource exploitation: A dynamic coalitional stability perspective," Mathematical Social Sciences, Elsevier, vol. 119(C), pages 1-10.
    17. Dietzenbacher, Bas & Núñez Lugilde, Iago & Sánchez-Rodríguez, Estela, 2025. "Streaming platform games: construction of the core," Research Memorandum 009, Maastricht University, Graduate School of Business and Economics (GSBE).
    18. Robert P. Gilles & Lina Mallozzi, 2025. "Gately values of cooperative games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 79(3), pages 723-758, May.
    19. Platz, T.T. & Hamers, H.J.M. & Quant, M., 2011. "Characterizing Compromise Stability of Games Using Larginal Vectors," Discussion Paper 2011-058, Tilburg University, Center for Economic Research.
    20. Christopher Blier-Wong & Jean-Gabriel Lauzier, 2026. "Designing entry-monotone risk-sharing pools," Papers 2606.00972, arXiv.org.

    More about this item

    Keywords

    ;
    ;
    ;

    JEL classification:

    • 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:unm:umagsb:2026008. 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: Andrea Willems or Angie Figueroa Alarcon (email available below). General contact details of provider: https://edirc.repec.org/data/meteonl.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.