The average covering tree value for directed graph games

DOI10.1007/S10878-019-00471-5MaRDI QIDQ2292145zbMATHOpenAlexFDO

Authors Anna B. Khmelnitskaya, Özer Selçuk, Dolf 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

zbMATH Keywords

stabilityTU gameMyerson valueaverage tree solutiondirected communication structuremarginal contribution vector

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

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

Cites work

• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Contributions to the theory of games. Vol. II
• Graphs and Cooperation in Games
• Solution concepts for games with general coalitional structure
• The Shapley value for directed graph games
• The average tree solution for cooperative games with communication structure
• The average tree solution for cycle-free graph games
• The covering values for acyclic digraph games
• Tree, web and average web values for cycle-free directed graph games
• Values for rooted-tree and sink-tree digraph games and sharing a river

Cited in

(9)

• The two-step average tree value for graph and hypergraph games
• The average tree value for hypergraph games
• The Myerson value for directed graph games
• A characterization of the average tree solution for tree games
• The Shapley value for directed graph games
• Computational complexity of a solution for directed graph cooperative games
• The covering values for acyclic digraph games
• Tree, web and average web values for cycle-free directed graph games
• Average tree solutions and the distribution of Harsanyi dividends

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)