The average tree solution for cycle-free graph games
From MaRDI portal
Publication:2483116
DOI10.1016/j.geb.2007.03.007zbMath1135.91316OpenAlexW2170102606MaRDI QIDQ2483116
Gerard van der Laan, Adolphus J. J. Talman, P. Jean-Jacques Herings
Publication date: 28 April 2008
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://pure.uvt.nl/ws/files/959362/AverTreeSol-GEB2008.pdf
Related Items (66)
Axiomatic characterizations under players nullification ⋮ Component-wise proportional solutions for communication graph games ⋮ Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution ⋮ Unnamed Item ⋮ Coalitional desirability and the equal division value ⋮ The stability and efficiency of direct and star networks in a loan game ⋮ Efficient extensions of communication values ⋮ Networks, Communication and Hierarchy: Applications to Cooperative Games ⋮ Axiomatization of an allocation rule for ordered tree TU-games ⋮ Values for games with two-level communication structures ⋮ Hierarchical outcomes and collusion neutrality on networks ⋮ The proportional Shapley value and applications ⋮ Luxembourg in the early days of the EEC: null player or not? ⋮ Solutions of cooperative games with a major player and a hierarchical structure ⋮ Efficiency and collusion neutrality in cooperative games and networks ⋮ Two efficient values of cooperative games with graph structure based on \(\tau\)-values ⋮ Associated consistency, value and graphs ⋮ Sharing a river with downstream externalities ⋮ The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations ⋮ Allocation rules for multi-choice games with a permission tree structure ⋮ The Egalitarian efficient extension of the Aumann-Drèze value ⋮ Tree solutions and standardness for cycle-free graph games ⋮ Comparable axiomatizations of the average tree solution and the Myerson value ⋮ Stable outcomes in simple cooperative games ⋮ Average tree solution in multi-agent systems with network structure ⋮ 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 ⋮ Two-step values for games with two-level communication structure ⋮ Balanced per capita contributions and level structure of cooperation ⋮ A strategic implementation of the average tree solution for cycle-free graph games ⋮ Unnamed Item ⋮ The covering values for acyclic digraph games ⋮ Equivalence and axiomatization of solutions for cooperative games with circular communication structure ⋮ Compensations in the Shapley value and the compensation solutions for graph games ⋮ The Myerson value for directed graph games ⋮ Discounted tree solutions ⋮ The within groups and the between groups Myerson values ⋮ A simple family of solutions for forest games ⋮ The core of games on ordered structures and graphs ⋮ On the inverse problem for a subclass of linear, symmetric and efficient values of cooperative TU games ⋮ Games with a permission structure -- a survey on generalizations and applications ⋮ Monotonicity of power in weighted voting games with restricted communication ⋮ An axiomatic characterization of the position value for network situations ⋮ A characterization of the average tree solution for tree games ⋮ Tree, web and average web values for cycle-free directed graph games ⋮ The average tree permission value for games with a permission tree ⋮ The average tree solution for multi-choice forest games ⋮ Average tree solutions and the distribution of Harsanyi dividends ⋮ Values for rooted-tree and sink-tree digraph games and sharing a river ⋮ The average tree solution for cooperative games with communication structure ⋮ Weighted component fairness for forest games ⋮ On the Position Value for Special Classes of Networks ⋮ The average covering tree value for directed graph games ⋮ Assignment of heterogeneous agents in trees under the permission value ⋮ Characterization of the average tree solution and its kernel ⋮ A bi-average tree solution for probabilistic communication situations with fuzzy coalition ⋮ Fuzzy Average Tree Solution for Graph Games with Fuzzy Coalitions ⋮ The average tree value for hypergraph games ⋮ The center value: a sharing rule for cooperative games on acyclic graphs ⋮ Rooted-tree solutions for tree games ⋮ THE RIVER SHARING PROBLEM: A SURVEY ⋮ The \(cg\)-average tree value for games on cycle-free fuzzy communication structures ⋮ Priority relations and cooperation with multiple activity levels ⋮ A Simple Bargaining Procedure for the Myerson Value
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conference structures and fair allocation rules
- Cores of partitioning games
- Strongly balanced cooperative games
- Intermediate preferences and stable coalition structures
- A characterization of the position value
- Values of Graph-Restricted Games
- 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
This page was built for publication: The average tree solution for cycle-free graph games
