Weighted component fairness for forest games
From MaRDI portal
Publication:712475
DOI10.1016/J.MATHSOCSCI.2012.03.004zbMATH Open1252.91027OpenAlexW2104540558MaRDI QIDQ712475FDOQ712475
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Cores of convex games
- The average tree solution for cooperative games with communication structure
- Graphs and Cooperation in Games
- The core of games on ordered structures and graphs
- The average tree solution for cycle-free graph games
- Title not available (Why is that?)
- The selectope for cooperative games
- Rooted-tree solutions for tree games
- An average lexicographic value for cooperative games
- The Myerson value for union stable structures
- Component efficient solutions in line-graph games with applications
- Harsanyi power solutions for graph-restricted games
- Average tree solutions and the distribution of Harsanyi dividends
- On hierarchies and communication
- Title not available (Why is that?)
Cited In (6)
- The core of games on ordered structures and graphs
- Component-wise proportional solutions for communication graph games
- Characterization of the average tree solution and its kernel
- Weighted allocation rules for standard fixed tree 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
This page was built for publication: Weighted component fairness for forest games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712475)
