The Shapley value for directed graph games

DOI10.1016/J.ORL.2015.12.009MaRDI QIDQ1785488zbMATH OpenOpenAlexFDO

Authors Özer Selçuk, Anna B. Khmelnitskaya, Dolf Talman

Publication date 28 September 2018

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

Full work available at URL https://researchportal.port.ac.uk/portal/en/publications/the-shapley-value-for-directed-graph-games(8245e75c-2a16-438a-9adc-e9fcfa40f03f).html

zbMATH Keywords

convexitycoreShapley valuedirected graphTU gamedominance structure

Mathematics Subject Classification ID

Cooperative games (91A12) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Values for games on the cycles of a digraph
• Digraph competitions and cooperative games
• The average covering tree value for directed graph games
• Values on regular games under Kirchhoff's laws
• Values for cooperative games over graphs and games with inadmissible coalitions

Cites work

• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Cooperative games with coalition structures
• Games with permission structures: The conjunctive approach
• Graphs and Cooperation in Games
• Mathematical economics and game theory. Essays in honor of Oskar Morgenstern
• Monotonic solutions of cooperative games
• The Shapley value for cooperative games under precedence constraints

Cited in

(19)

• The degree measure as utility function over positions in graphs and digraphs
• The average covering tree value for directed graph games
• Values on regular games under Kirchhoff's laws
• The Myerson value on local structures of coalitions
• A value for communication situations with players having different bargaining abilities
• Shapley value for differential network games: theory and application
• On the Shapley value of liability games
• The Myerson value for directed graph games
• Measuring power in coalitional games with friends, enemies and allies
• A note on the \(\beta\)-measure for digraph competitions
• Directed communication in games with directed graphs
• The covering values for acyclic digraph games
• The Shapley value for shortest path games: a non-graph-based approach
• Directed graphical structure, Nash equilibrium, and potential games
• Cooperative games with restricted formation of coalitions
• The apex power measure for directed networks
• Hodge decomposition and the Shapley value of a cooperative game
• Values for games on the cycles of a digraph
• Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785488)