Characterization of the average tree solution and its kernel
From MaRDI portal
Publication:745019
DOI10.1016/j.jmateco.2015.07.001zbMath1368.91042OpenAlexW1486064085MaRDI QIDQ745019
Eric Rémila, Philippe Solal, Sylvain Béal
Publication date: 12 October 2015
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: https://crese.univ-fcomte.fr/uploads/wp/WP-2014-04.pdf
inverse problemkerneldirect-sum decompositionaverage tree solutioninvariance to irrelevant coalitionsweighted addition invariance on bi-partitions
Related Items (6)
Characterizations of weighted and equal division values ⋮ Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution ⋮ Comparable axiomatizations of the average tree solution and the Myerson value ⋮ Discounted tree solutions ⋮ Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations ⋮ On the inverse problem for a subclass of linear, symmetric and efficient values of cooperative TU games
Cites Work
- Unnamed Item
- Efficiency and collusion neutrality in cooperative games and networks
- A characterization of the average tree solution for tree games
- Axiomatizations of two types of Shapley values for games on union closed systems
- Average tree solutions and the distribution of Harsanyi dividends
- Weighted component fairness for forest games
- Axioms of invariance for TU-games
- Rooted-tree solutions for tree games
- The average tree solution for multi-choice forest games
- Decomposition of the space of TU-games, strong transfer invariance and the Banzhaf value
- Value, consistency, and random coalition formation
- The average tree permission value for games with a permission tree
- The average tree solution for cooperative games with communication structure
- A decomposition of the space of TU-games using addition and transfer invariance
- Weak addition invariance and axiomatization of the weighted Shapley value
- A strategic implementation of the average tree solution for cycle-free graph games
- The average tree solution for cycle-free graph games
- Equivalent N-Person Games and the Null Space of the Shapley Value
- Graphs and Cooperation in Games
This page was built for publication: Characterization of the average tree solution and its kernel