The average tree solution for cooperative games with communication structure
From MaRDI portal
Publication:2268115
DOI10.1016/j.geb.2009.10.002zbMath1198.91067MaRDI 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
90B18: Communication networks in operations research
91A43: Games involving graphs
91B12: Voting theory
Related Items
On the Position Value for Special Classes of Networks, Fuzzy Average Tree Solution for Graph Games with Fuzzy Coalitions, 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, Characterizations of the core of TU and NTU games with communication structures, The prenucleolus and the prekernel for games with communication structures, Parameterized fairness axioms on cycle-free graph games, A simple family of solutions for forest games, Average tree solutions and the distribution of Harsanyi dividends, Compensations in the Shapley value and the compensation solutions for graph games, Weighted component fairness for forest games, Characterization of the average tree solution and its kernel, Luxembourg in the early days of the EEC: null player or not?, Monotonicity of power in weighted voting games with restricted communication, The \(cg\)-position value for games on fuzzy communication structures, A necessary and sufficient condition for non-emptiness of the core of a non-transferable utility game, Hyperadditive games and applications to networks or matching problems, 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, The average tree permission value for games with a permission tree, The average covering tree value for directed graph games, The \(cg\)-average tree value for games on cycle-free fuzzy communication structures, Solution concepts for games with general coalitional structure, Equivalence and axiomatization of solutions for cooperative games with circular communication structure, The stability and efficiency of direct and star networks in a loan game, Solutions of cooperative games with a major player and a hierarchical structure, Unnamed Item
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
