Directed communication in games with directed graphs

DOI10.1007/S11750-023-00654-8MaRDI QIDQ6081614zbMATH OpenFDO

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

Publication date 26 October 2023

Published in Top (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11750-023-00654-8

zbMATH Keywords

axiomatizationscooperative TU-gamedirected graphdirected network centrality measuregame theoryShapley value

Mathematics Subject Classification ID

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

Recommendations

• Communication and its cost in graph-restricted games
• An efficient and fair solution for communication graph games
• Coordination games on directed graphs
• The communication complexity of graphical games on grid graphs
• Nash equilibria in games over graphs equipped with a communication mechanism
• Communication with tokens in repeated games on networks
• On a game in directed graphs.
• On the convexity of communication games
• Component-wise proportional solutions for communication graph games
• Coordination games on weighted directed graphs

Cites work

• A Shapley distance in graphs
• Accessibility in oriented networks
• An axiomatization of the disjunctive permission value for games with a permission structure
• Axiomatizations of the conjunctive permission value for games with permission structures
• Centrality and power in social networks: A game theoretic approach.
• Conference structures and fair allocation rules
• Digraph competitions and cooperative games
• Efficient algorithms for game-theoretic betweenness centrality
• Efficient computation of semivalues for game-theoretic network centrality
• Efficient computation of the Shapley value for game-theoretic network centrality
• Game-theoretic centrality measures for weighted graphs
• Games with permission structures: The conjunctive approach
• Generating functions and the Myerson vector in communication networks
• Graphs and Cooperation in Games
• scientific article; zbMATH DE number 3138565 (Why is no real title available?)
• scientific article; zbMATH DE number 3704610 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• The center value: a sharing rule for cooperative games on acyclic graphs
• The Myerson value for directed graph games
• The Shapley value for cooperative games under precedence constraints
• The Shapley value for directed graph games
• Towards a metric for communication network vulnerability to attacks: a game theoretic approach

Cited in

(5)

• The Myerson value for directed graph games
• Fair link contributions for values of network cooperative games
• Mutually dependent, balanced contributions, and the priority value
• Latencies in multicommunication. A view from game theory
• Directed elimination games

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

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