The covering values for acyclic digraph games
From MaRDI portal
Publication:647347
Recommendations
Cites work
- scientific article; zbMATH DE number 5823886 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- An axiomatization of the disjunctive permission value for games with a permission structure
- Component efficient solutions in line-graph games with applications
- Games with permission structures: The conjunctive approach
- Graphs and Cooperation in Games
- The Shapley value for cooperative games under precedence constraints
- The average tree solution for cycle-free graph games
- Values for rooted-tree and sink-tree digraph games and sharing a river
Cited in
(8)- Comparable characterizations of four solutions for permission tree games
- The average covering tree value for directed graph games
- The river sharing problem: a survey
- Values for rooted-tree and sink-tree digraph games and sharing a river
- The Myerson value for directed graph games
- Values for games on the cycles of a digraph
- Tree, web and average web values for cycle-free directed graph games
- The average tree permission value for games with a permission tree
This page was built for publication: The covering values for acyclic digraph games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647347)