The average covering tree value for directed graph games
From MaRDI portal
Publication:2292145
DOI10.1007/s10878-019-00471-5zbMath1434.91009OpenAlexW2106902388MaRDI QIDQ2292145
Özer Selçuk, Anna B. Khmelnitskaya, Adolphus J. J. Talman
Publication date: 3 February 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00471-5
stabilityTU gameMyerson valueaverage tree solutiondirected communication structuremarginal contribution vector
Related Items
Cites Work
- Unnamed Item
- The covering values for acyclic digraph games
- Values for rooted-tree and sink-tree digraph games and sharing a river
- The Shapley value for directed graph games
- Tree, web and average web values for cycle-free directed graph games
- The average tree solution for cooperative games with communication structure
- Solution concepts for games with general coalitional structure
- The average tree solution for cycle-free graph games
- Contributions to the Theory of Games (AM-28), Volume II
- Graphs and Cooperation in Games
This page was built for publication: The average covering tree value for directed graph games