An efficient and fair solution for communication graph games
From MaRDI portal
Recommendations
- Component-wise proportional solutions for communication graph games
- The efficient proportional Myerson values
- Parameterized fairness axioms on cycle-free graph games
- Efficient extensions of the Myerson value
- On the existence of efficient and fair extensions of communication values for connected graphs
Cites work
Cited in
(27)- An algorithm for computing the stable coalition structures in tree-graph communication games
- Efficient extensions of communication values
- On the existence of efficient and fair extensions of communication values for connected graphs
- Cost sharing on prices for games on graphs
- Fair distribution of surplus and efficient extensions of the Myerson value
- A non-parametric approach to testing the axioms of the Shapley value with limited data
- Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
- The Myerson value for directed graph games
- Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations
- The efficient proportional Myerson values
- The weighted Shapley-egalitarian value for cooperative games with a coalition structure
- The Myerson value on local structures of coalitions
- Two efficient values of cooperative games with graph structure based on \(\tau\)-values
- Coalitional surplus desirability and the equal surplus division value
- The Egalitarian efficient extension of the Aumann-Drèze value
- The efficient partition surplus Owen graph value
- Component-wise proportional solutions for communication graph games
- An Owen-type value for games with two-level communication structure
- Union-wise egalitarian solutions in cooperative games with a coalition structure
- Directed communication in games with directed graphs
- Efficient extensions of the Myerson value based on endogenous claims from players
- The probabilistic Harsanyi power solutions for probabilistic graph games
- Games restricted by simplicial complexes and an application to vertiport cooperation
- k-boundedness, feasible communication structures, and the Myerson value
- Weighted component-wise solutions for graph games
- Efficient quotient extensions of the Myerson value
- Efficient extensions of the Myerson value
This page was built for publication: An efficient and fair solution for communication graph games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440450)
