The Myerson value for directed graph games

DOI10.1016/J.ORL.2020.01.005OpenAlexW3003165044MaRDI QIDQ1984682

Erfang Shan, Daniel Li Li

Publication date: 7 April 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2020.01.005

zbMATH Keywords

directed graphTU gameMyerson valuedirected graph gamestrongly connected set

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Directed communication in games with directed graphs

Cites Work

• Unnamed Item
• Component-wise proportional solutions for communication graph games
• Values of games with weighted graphs
• The covering values for acyclic digraph games
• Conference structures and fair allocation rules
• Allocation rules for hypergraph communication situations
• Values of games with probabilistic graphs
• The Myerson value for union stable structures
• The Shapley value for directed graph games
• Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
• Tree, web and average web values for cycle-free directed graph games
• The average covering tree value for directed graph games
• The efficient proportional Myerson values
• An efficient and fair solution for communication graph games
• The average tree solution for cycle-free graph games
• On the Position Value for Communication Situations
• Graphs and Cooperation in Games

This page was built for publication: The Myerson value for directed graph games