The average covering tree value for directed graph games
From MaRDI portal
Publication:2292145
DOI10.1007/S10878-019-00471-5zbMATH Open1434.91009OpenAlexW2106902388MaRDI QIDQ2292145FDOQ2292145
Dolf Talman, Özer Selçuk, Anna B. Khmelnitskaya
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
Recommendations
- The average tree value for hypergraph games
- Tree, web and average web values for cycle-free directed graph games
- The two-step average tree value for graph and hypergraph games
- The average tree solution for cycle-free graph games
- The average tree solution on graph games with interval payoffs
- AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES
- A characterization of the average tree solution for tree games
- The covering values for acyclic digraph games
- A strategic implementation of the average tree solution for cycle-free graph games
- The average tree solution in graph games with fuzzy coalitions
stabilityTU gameMyerson valueaverage tree solutiondirected communication structuremarginal contribution vector
Cites Work
- The average tree solution for cooperative games with communication structure
- Graphs and Cooperation in Games
- Title not available (Why is that?)
- The average tree solution for cycle-free graph games
- Contributions to the Theory of Games (AM-28), Volume II
- Values for rooted-tree and sink-tree digraph games and sharing a river
- Tree, web and average web values for cycle-free directed graph games
- The covering values for acyclic digraph games
- The Shapley value for directed graph games
- Solution concepts for games with general coalitional structure
Cited In (3)
This page was built for publication: The average covering tree value for directed graph games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292145)
