The Myerson value for directed graph games
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- Allocation rules for hypergraph communication situations
- An efficient and fair solution for communication graph games
- Component-wise proportional solutions for communication graph games
- Conference structures and fair allocation rules
- Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
- Graphs and Cooperation in Games
- On the Position Value for Communication Situations
- The Myerson value for union stable structures
- The Shapley value for directed graph games
- The average covering tree value for directed graph games
- The average tree solution for cycle-free graph games
- The covering values for acyclic digraph games
- The efficient proportional Myerson values
- Tree, web and average web values for cycle-free directed graph games
- Values of games with probabilistic graphs
- Values of games with weighted graphs
Cited in
(3)
This page was built for publication: The Myerson value for directed graph games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1984682)