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

DOI10.1016/J.EJOR.2013.10.014zbMATH Open1305.91049OpenAlexW2148500329MaRDI QIDQ2256222FDOQ2256222

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

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

zbMATH Keywords

efficiencystabilityTU gamedirected graph communication structuremanagement team

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• The Myerson value for directed graph games
• The covering values for acyclic digraph games
• Values for rooted-tree and sink-tree digraph games and sharing a river
• The average covering tree value for directed graph games
• The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations
• 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)