The Myerson value for directed graph games
type: Item
instance of: scholarly article
title: The Myerson value for directed graph games
author: Daniel Li Li
author: Erfang Shan
published in: Operations Research Letters
publication date: 2020-04-07T00:00:00Z
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7186953
zbMATH Keywords: TU game
zbMATH Keywords: Myerson value
zbMATH Keywords: directed graph
zbMATH Keywords: directed graph game
zbMATH Keywords: strongly connected set
MaRDI profile type: Publication
full work available at URL: j.orl.2020.01.005
OpenAlex ID: W3003165044
cites work: The Myerson value for union stable structures
cites work: Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
cites work: On the Position Value for Communication Situations
cites work: Values of games with probabilistic graphs
cites work: Values of games with weighted graphs
cites work: The average tree solution for cycle-free graph games
cites work: The Shapley value for directed graph games
cites work: The average covering tree value for directed graph games
cites work: Tree, web and average web values for cycle-free directed graph games
cites work: The covering values for acyclic digraph games
cites work: Graphs and Cooperation in Games
cites work: Conference structures and fair allocation rules
cites work: The efficient proportional Myerson values
cites work: Component-wise proportional solutions for communication graph games
cites work: Q5817870
cites work: An efficient and fair solution for communication graph games
cites work: Allocation rules for hypergraph communication situations
DOI: 10.1016/J.ORL.2020.01.005
description: scientific article; zbMATH DE number 7186953