The average tree solution for cooperative games with communication structure

DOI10.1016/j.geb.2009.10.002zbMath1198.91067OpenAlexW3125550639MaRDI QIDQ2268115

Gerard van der Laan, Zaifu Yang, Adolphus J. J. Talman, P. Jean-Jacques Herings

Publication date: 10 March 2010

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://research.tilburguniversity.edu/en/publications/24359ac5-6399-42ee-8f0b-7024fe1ba613

zbMATH Keywords

convexitycorespanning treecooperative gamegraph structuresingle-valued solution

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Games involving graphs (91A43) Voting theory (91B12)

Related Items (30)

A necessary and sufficient condition for non-emptiness of the core of a non-transferable utility game ⋮ Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution ⋮ Unnamed Item ⋮ The stability and efficiency of direct and star networks in a loan game ⋮ Luxembourg in the early days of the EEC: null player or not? ⋮ Solutions of cooperative games with a major player and a hierarchical structure ⋮ The prenucleolus and the prekernel for games with communication structures ⋮ The \(\alpha \)-egalitarian Myerson value of games with communication structure ⋮ Comparable axiomatizations of the average tree solution and the Myerson value ⋮ The two-step average tree value for graph and hypergraph games ⋮ The probabilistic Harsanyi power solutions for probabilistic graph games ⋮ Parameterized fairness axioms on cycle-free graph games ⋮ Optimal strategies and profit allocation for three-echelon food supply chain in view of cooperative games with cycle communication structure ⋮ Solution concepts for games with general coalitional structure ⋮ Equivalence and axiomatization of solutions for cooperative games with circular communication structure ⋮ Compensations in the Shapley value and the compensation solutions for graph games ⋮ A simple family of solutions for forest games ⋮ Hyperadditive games and applications to networks or matching problems ⋮ Monotonicity of power in weighted voting games with restricted communication ⋮ The average tree permission value for games with a permission tree ⋮ Average tree solutions and the distribution of Harsanyi dividends ⋮ Weighted component fairness for forest games ⋮ On the Position Value for Special Classes of Networks ⋮ The \(cg\)-position value for games on fuzzy communication structures ⋮ The average covering tree value for directed graph games ⋮ Characterization of the average tree solution and its kernel ⋮ Fuzzy Average Tree Solution for Graph Games with Fuzzy Coalitions ⋮ The average tree value for hypergraph games ⋮ The \(cg\)-average tree value for games on cycle-free fuzzy communication structures ⋮ Characterizations of the core of TU and NTU games with communication structures

Cites Work

• Unnamed Item
• Unnamed Item
• Conference structures and fair allocation rules
• The average tree solution for cycle-free graph games
• A characterization of the position value
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
• On the Position Value for Communication Situations
• Graphs and Cooperation in Games
• AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES

This page was built for publication: The average tree solution for cooperative games with communication structure