Graph-restricted games and their inheritance of properties

Bas Dietzenbacher and Dries Vermeulen
Additional contact information
Bas Dietzenbacher: RS: GSBE other - not theme-related research, QE Math. Economics & Game Theory
Dries Vermeulen: RS: GSBE other - not theme-related research, QE Math. Economics & Game Theory, RS: GSBE MCM

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

Abstract: For communication situations where the communication possibilities of players are modeled by an undirected graph, we study to what extent Myerson’s graph-restricted game inherits properties from the original transferable utility game. We focus on monotonicity, additivity, superadditivity, convexity, imputation admissibility, balancedness, total balancedness, population monotonic allocation schemes, and exactness. For each of these properties, we characterize all communication graphs that guarantee the inheritance. We present existing results from the literature and we provide new results.

JEL-codes: C71 (search for similar items in EconPapers)
Date: 2025-03-31
New Economics Papers: this item is included in nep-gth and nep-mac
References: Add references at CitEc
Citations:

Downloads: (external link)
https://cris.maastrichtuniversity.nl/ws/files/247272913/RM25003.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:2025003

DOI: 10.26481/umagsb.2025003

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 Leonne Portz ().