Rooted-tree solutions for tree games
From MaRDI portal
Publication:1046115
DOI10.1016/j.ejor.2009.07.023zbMath1177.91055MaRDI QIDQ1046115
Eric Rémila, Sylvain Béal, Philippe Solal
Publication date: 21 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.07.023
Related Items
The core of games on ordered structures and graphs, Hierarchical outcomes and collusion neutrality on networks, Efficiency and collusion neutrality in cooperative games and networks, Discounted tree solutions, 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, The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations, The within groups and the between groups Myerson values, The average tree solution for multi-choice forest games, Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution, Tree, web and average web values for cycle-free directed graph games, On the restricted cores and the bounded core of games on distributive lattices, The average tree permission value for games with a permission tree, A strategic implementation of the average tree solution for cycle-free graph games, Tree solutions and standardness for cycle-free graph games, THE RIVER SHARING PROBLEM: A SURVEY
Cites Work
