Weighted component fairness for forest games

DOI10.1016/j.mathsocsci.2012.03.004zbMath1252.91027OpenAlexW2104540558MaRDI QIDQ712475

Eric Rémila, Sylvain Béal, Philippe Solal

Publication date: 16 October 2012

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2012.03.004

Mathematics Subject Classification ID

Trees (05C05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (5)

Component-wise proportional solutions for communication graph games ⋮ The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations ⋮ A simple family of solutions for forest games ⋮ The core of games on ordered structures and graphs ⋮ Characterization of the average tree solution and its kernel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An average lexicographic value for cooperative games
• Harsanyi power solutions for graph-restricted games
• Average tree solutions and the distribution of Harsanyi dividends
• Rooted-tree solutions for tree games
• The Myerson value for union stable structures
• The selectope for cooperative games
• The average tree solution for cooperative games with communication structure
• Component efficient solutions in line-graph games with applications
• On hierarchies and communication
• The average tree solution for cycle-free graph games
• Cores of convex games
• Graphs and Cooperation in Games
• The core of games on ordered structures and graphs

This page was built for publication: Weighted component fairness for forest games