The covering values for acyclic digraph games
type: Item
instance of: scholarly article
title: The covering values for acyclic digraph games
zbMATH Open document ID: 1233.91049
author: Lei Li
author: Xueliang Li
published in: International Journal of Game Theory
publication date: 2011-11-23T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 5977568
zbMATH Keywords: TU game
zbMATH Keywords: covering value
zbMATH Keywords: efficiency
zbMATH Keywords: Harsanyi dividend
zbMATH Keywords: acyclic digraph game
MaRDI profile type: Publication
full work available at URL: s00182-010-0264-4
OpenAlex ID: W2091100110
cites work: The Shapley value for cooperative games under precedence constraints
cites work: Games with permission structures: The conjunctive approach
cites work: The average tree solution for cycle-free graph games
cites work: Values for rooted-tree and sink-tree digraph games and sharing a river
cites work: Q3059253
cites work: Graphs and Cooperation in Games
cites work: Q5817870
cites work: An axiomatization of the disjunctive permission value for games with a permission structure
cites work: Component efficient solutions in line-graph games with applications
DOI: 10.1007/S00182-010-0264-4
description: scientific article; zbMATH DE number 5977568