A characterization of the average tree solution for tree games

DOI10.1007/s00182-009-0194-1zbMath1211.91084OpenAlexW2002366032MaRDI 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

treeShapley valueMyerson valuegraph games

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Related Items (9)

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

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

This page was built for publication: A characterization of the average tree solution for tree games