Tree, web and average web values for cycle-free directed graph games

DOI10.1016/J.EJOR.2013.10.014MaRDI QIDQ2256222zbMATH OpenOpenAlexFDO

Authors Anna B. Khmelnitskaya, Dolf 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

zbMATH Keywords

efficiencystabilityTU gamedirected graph communication structuremanagement team

Mathematics Subject Classification ID

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

Recommendations

• Values for rooted-tree and sink-tree digraph games and sharing a river
• The average covering tree value for directed graph games
• The average tree solution for cycle-free graph games
• The average tree value for hypergraph games
• The two-step average tree value for graph and hypergraph games

Cites work

• Component efficient solutions in line-graph games with applications
• Cores of convex games
• Graphs and Cooperation in Games
• Rooted-tree solutions for tree games
• Sharing a river.
• The Shapley value for cooperative games under precedence constraints
• The average tree solution for cycle-free graph games
• The covering values for acyclic digraph games
• Values for rooted-tree and sink-tree digraph games and sharing a river

Cited in

(7)

• The average covering tree value for directed graph games
• Values for rooted-tree and sink-tree digraph games and sharing a river
• 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
• The covering values for acyclic digraph games
• Discounted tree solutions
• Multi-sided assignment games on \(m\)-partite graphs

This page was built for publication: Tree, web and average web values for cycle-free directed graph games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256222)