TY - UNPB
T1 - Graph-restricted games and their inheritance of properties
AU - Dietzenbacher, Bas
AU - Vermeulen, Dries
PY - 2025/3/31
Y1 - 2025/3/31
N2 - 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.
AB - 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.
KW - communication situation
KW - graph-restricted game
KW - inheritance
U2 - 10.26481/umagsb.2025003
DO - 10.26481/umagsb.2025003
M3 - Working paper
T3 - GSBE Research Memoranda
BT - Graph-restricted games and their inheritance of properties
PB - Maastricht University, Graduate School of Business and Economics
CY - Maastricht
ER -