The covering values for acyclic digraph games

DOI10.1007/s00182-010-0264-4zbMath1233.91049OpenAlexW2091100110MaRDI QIDQ647347

Lei Li, Xue Liang 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

zbMATH Keywords

efficiencyTU gameHarsanyi dividendacyclic digraph gamecovering value

Mathematics Subject Classification ID

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

Related Items (6)

The Myerson value for directed graph games ⋮ Comparable characterizations of four solutions for permission tree games ⋮ Tree, web and average web values for cycle-free directed graph games ⋮ The average tree permission value for games with a permission tree ⋮ The average covering tree value for directed graph games ⋮ THE RIVER SHARING PROBLEM: A SURVEY

Cites Work

• Values for rooted-tree and sink-tree digraph games and sharing a river
• Games with permission structures: The conjunctive approach
• The Shapley value for cooperative games under precedence constraints
• An axiomatization of the disjunctive permission value for games with a permission structure
• Component efficient solutions in line-graph games with applications
• The average tree solution for cycle-free graph games
• Graphs and Cooperation in Games
• Unnamed Item
• Unnamed Item

This page was built for publication: The covering values for acyclic digraph games