Tree, web and average web values for cycle-free directed graph games
From MaRDI portal
Publication:2256222
DOI10.1016/j.ejor.2013.10.014zbMath1305.91049OpenAlexW2148500329MaRDI QIDQ2256222
Anna B. Khmelnitskaya, Adolphus J. J. Talman
Publication date: 19 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.014
Related Items
The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations, The Myerson value for directed graph games, Discounted tree solutions, Multi-sided assignment games on \(m\)-partite graphs, The average covering tree value for directed graph games
Cites Work
- The covering values for acyclic digraph games
- Values for rooted-tree and sink-tree digraph games and sharing a river
- Rooted-tree solutions for tree games
- The Shapley value for cooperative games under precedence constraints
- Sharing a river.
- Component efficient solutions in line-graph games with applications
- The average tree solution for cycle-free graph games
- Cores of convex games
- Graphs and Cooperation in Games