Two-bound core games with communication restrictions

Ziyi Chai and Bas Dietzenbacher

No 8, Research Memorandum from Maastricht University, Graduate School of Business and Economics (GSBE)

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.

Keywords: two-bound core games; communication situations; graph-restricted games (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
Date: 2026-09-10
References: Add references at CitEc
Citations:

Downloads: (external link)
https://cris.maastrichtuniversity.nl/ws/files/323027936/RM26008.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:unm:umagsb:2026008

DOI: 10.26481/umagsb.2026008

Access Statistics for this paper

More papers in Research Memorandum from Maastricht University, Graduate School of Business and Economics (GSBE) Contact information at EDIRC.
Bibliographic data for series maintained by Andrea Willems () and Angie Figueroa Alarcon ().