Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
From MaRDI portal
Publication:1925896
DOI10.1016/J.ECONLET.2012.05.020zbMATH Open1254.91021OpenAlexW1846668434MaRDI QIDQ1925896FDOQ1925896
Philippe Solal, Eric Rémila, Sylvain Béal
Publication date: 27 December 2012
Published in: Economics Letters (Search for Journal in Brave)
Full work available at URL: https://mpra.ub.uni-muenchen.de/36857/1/MPRA_paper_36857.pdf
Cites Work
- Title not available (Why is that?)
- Potential, Value, and Consistency
- Graphs and Cooperation in Games
- Null or nullifying players: the difference between the Shapley value and equal division solutions
- An efficient and fair solution for communication graph games
- A TWO-STEP SHAPLEY VALUE FOR COOPERATIVE GAMES WITH COALITION STRUCTURES
- Bidding for surplus in network allocation problems
- Solidarity in games with a coalition structure
Cited In (18)
- The Myerson value for directed graph games
- Efficient extensions of the Myerson value
- The Myerson value on local structures of coalitions
- Efficient extensions of communication values
- On the existence of efficient and fair extensions of communication values for connected graphs
- Component-wise proportional solutions for communication graph games
- Fair distribution of surplus and efficient extensions of the Myerson value
- Union-wise egalitarian solutions in cooperative games with a coalition structure
- Two efficient values of cooperative games with graph structure based on \(\tau\)-values
- The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations
- An Owen-type value for games with two-level communication structure
- Solidarity within a fixed community
- Null, nullifying, or dummifying players: the difference between the Shapley value, the equal division value, and the equal surplus division value
- Weighted component-wise solutions for graph games
- Cost sharing on prices for games on graphs
- An efficient and fair solution for communication graph games
- Tree solutions and standardness for cycle-free graph games
- Essential Players in Cooperative Games with Graph Communication Structure
This page was built for publication: Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925896)
