Rooted-tree solutions for tree games

DOI10.1016/J.EJOR.2009.07.023MaRDI QIDQ1046115zbMATH OpenOpenAlexFDO

Authors Sylvain Béal, Eric Rémila, 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

zbMATH Keywords

communication structureaverage tree solutionmarginal contributionsrandom (order) values

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• Characterization of the average tree solution and its kernel
• The average tree solution for cycle-free graph games
• The average tree solution for multi-choice forest games
• A characterization of the average tree solution for tree games
• The average tree solution for cooperative games with communication structure

Cites work

• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Convex multi-choice games: characterizations and monotonic allocation schemes
• Games on lattices, multichoice games and the Shapley value: a new approach
• Graphs and Cooperation in Games
• Harsanyi power solutions for graph-restricted games
• The average tree solution for cycle-free graph games

Cited in

(23)

• The river sharing problem: a survey
• The average tree solution for multi-choice forest games
• scientific article; zbMATH DE number 7362735 (Why is no real title available?)
• Tree, web and average web values for cycle-free directed graph games
• The average tree permission value for games with a permission tree
• Characterization of the average tree solution and its kernel
• A strategic implementation of the average tree solution for cycle-free graph games
• The within groups and the between groups Myerson values
• 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
• Thick Subtrees, Games and Experiments
• Hierarchical outcomes and collusion neutrality on networks
• On the restricted cores and the bounded core of games on distributive lattices
• Efficiency and collusion neutrality in cooperative games and networks
• The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations
• Political power on a line graph
• Tree solutions and standardness for cycle-free graph games
• Compensations in the Shapley value and the compensation solutions for graph games
• Discounted tree solutions
• Fixed tree games with multilocated players
• A simple family of solutions for forest games
• Average tree solutions and the distribution of Harsanyi dividends
• scientific article; zbMATH DE number 3902439 (Why is no real title available?)

This page was built for publication: Rooted-tree solutions for tree games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046115)