A characterization of the average tree solution for tree games

DOI10.1007/s00182-009-0194-1zbMath1211.91084MaRDI QIDQ532714

Debasis Mishra, Adolphus J. J. Talman

Publication date: 5 May 2011

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-009-0194-1

zbMATH Keywords

tree; Shapley value; Myerson value; graph games

Mathematics Subject Classification ID

91A12: Cooperative games

91A43: Games involving graphs

Related Items

Comparable axiomatizations of the average tree solution and the Myerson value, Hierarchical outcomes and collusion neutrality on networks, Average tree solutions and the distribution of Harsanyi dividends, Characterization of the average tree solution and its kernel, From hierarchies to levels: new solutions for games with hierarchical structure, The average tree solution for multi-choice forest games, The average tree value for hypergraph games, Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution, Equivalence and axiomatization of solutions for cooperative games with circular communication structure

Cites Work

• Unnamed Item
• Conference structures and fair allocation rules
• Cores of partitioning games
• Strongly balanced cooperative games
• Intermediate preferences and stable coalition structures
• The average tree solution for cycle-free graph games
• On the Position Value for Communication Situations
• Graphs and Cooperation in Games