Directed communication in games with directed graphs

DOI10.1007/s11750-023-00654-8zbMath1525.05131MaRDI QIDQ6081614

Conrado Miguel Manuel, René van den Brink, E. C. Gavilán

Publication date: 26 October 2023

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

game theoryShapley valuedirected graphcooperative TU-gameaxiomatizationsdirected network centrality measure

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Cooperative games (91A12) Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The center value: a sharing rule for cooperative games on acyclic graphs
• A Shapley distance in graphs
• Accessibility in oriented networks
• Efficient algorithms for game-theoretic betweenness centrality
• Conference structures and fair allocation rules
• 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
• Centrality and power in social networks: A game theoretic approach.
• Digraph competitions and cooperative games
• The Shapley value for directed graph games
• Axiomatizations of the conjunctive permission value for games with permission structures
• The Myerson value for directed graph games
• Generating functions and the Myerson vector in communication networks
• Towards a Metric for Communication Network Vulnerability to Attacks: A Game Theoretic Approach
• Graphs and Cooperation in Games
• Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality
• Efficient Computation of Semivalues for Game-Theoretic Network Centrality
• Game-Theoretic Centrality Measures for Weighted Graphs

This page was built for publication: Directed communication in games with directed graphs