The average tree solution for cooperative games with communication structure
DOI10.1016/J.GEB.2009.10.002zbMATH Open1198.91067OpenAlexW3125550639MaRDI QIDQ2268115FDOQ2268115
Authors: Gerard van der Laan, Zaifu Yang, P. Jean-Jacques Herings, Dolf Talman
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
Recommendations
- The average tree solution for cycle-free graph games
- AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES
- Comparable axiomatizations of the average tree solution and the Myerson value
- The average tree value for hypergraph games
- The \(cg\)-average tree value for games on cycle-free fuzzy communication structures
Communication networks in operations research (90B18) Games involving graphs (91A43) Voting theory (91B12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conference structures and fair allocation rules
- Graphs and Cooperation in Games
- The average tree solution for cycle-free graph games
- On the Position Value for Communication Situations
- A characterization of the position value
- AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
Cited In (41)
- Solutions for cooperative games with a major player and a hierarchical structure
- Characterizations of the core of TU and NTU games with communication structures
- The average tree solution for multi-choice forest games
- Hyperadditive games and applications to networks or matching problems
- The prenucleolus and the prekernel for games with communication structures
- The \(cg\)-average tree value for games on cycle-free fuzzy communication structures
- The two-step average tree value for graph and hypergraph games
- The average tree permission value for games with a permission tree
- Parameterized fairness axioms on cycle-free graph games
- A strategic implementation of the average tree solution for cycle-free graph games
- Characterization of the average tree solution and its kernel
- AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES
- Weighted component fairness for forest games
- Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution
- Monotonicity of power in weighted voting games with restricted communication
- The stability and efficiency of direct and star networks in a loan game
- The average tree value for hypergraph games
- A necessary and sufficient condition for non-emptiness of the core of a non-transferable utility game
- The average covering tree value for directed graph games
- The probabilistic Harsanyi power solutions for probabilistic graph games
- Luxembourg in the early days of the EEC: null player or not?
- An algorithm for computing the stable coalition structures in tree-graph communication games
- Comparable axiomatizations of the average tree solution and the Myerson value
- Solutions of cooperative games with a major player and a hierarchical structure
- A characterization of the average tree solution for tree games
- The average tree solution on graph games with interval payoffs
- Fuzzy Average Tree Solution for Graph Games with Fuzzy Coalitions
- Optimal strategies and profit allocation for three-echelon food supply chain in view of cooperative games with cycle communication structure
- The \(cg\)-position value for games on fuzzy communication structures
- The average tree solution for cycle-free graph games
- Rooted-tree solutions for tree games
- Tree solutions and standardness for cycle-free graph games
- Essential Players in Cooperative Games with Graph Communication Structure
- Compensations in the Shapley value and the compensation solutions for graph games
- Solution concepts for games with general coalitional structure
- The \(\alpha \)-egalitarian Myerson value of games with communication structure
- Title not available (Why is that?)
- Equivalence and axiomatization of solutions for cooperative games with circular communication structure
- A simple family of solutions for forest games
- Average tree solutions and the distribution of Harsanyi dividends
- On the position value for special classes of networks
This page was built for publication: The average tree solution for cooperative games with communication structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268115)