The covering values for acyclic digraph games
From MaRDI portal
Publication:647347
DOI10.1007/S00182-010-0264-4zbMATH Open1233.91049OpenAlexW2091100110MaRDI QIDQ647347FDOQ647347
Authors: Lei Li, Xueliang Li 
Publication date: 23 November 2011
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00182-010-0264-4
Recommendations
Cites Work
- Title not available (Why is that?)
- Games with permission structures: The conjunctive approach
- The Shapley value for cooperative games under precedence constraints
- Graphs and Cooperation in Games
- The average tree solution for cycle-free graph games
- An axiomatization of the disjunctive permission value for games with a permission structure
- Component efficient solutions in line-graph games with applications
- Values for rooted-tree and sink-tree digraph games and sharing a river
- Title not available (Why is that?)
Cited In (8)
- The river sharing problem: a survey
- The Myerson value for directed graph games
- Tree, web and average web values for cycle-free directed graph games
- The average tree permission value for games with a permission tree
- Values for rooted-tree and sink-tree digraph games and sharing a river
- The average covering tree value for directed graph games
- Values for games on the cycles of a digraph
- Comparable characterizations of four solutions for permission tree games
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)
