Game-theoretic centrality of directed graph vertices

DOI10.1134/S0005117924020061MaRDI QIDQ6581780zbMATH OpenFDO

Authors Vladimir V. Mazalov

Publication date 1 August 2024

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0005117924020061

zbMATH Keywords

centralitycooperative gamedirected graphgraph theory

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• Game theoretic centrality of a directed graph vertices
• A modified Myerson value for determining the centrality of graph vertices
• Centrality and power in social networks: A game theoretic approach.
• Axiomatic characterization of game-theoretic centrality
• Modified Myerson value for determining the centrality of graph vertices

Cites work

• A modified Myerson value for determining the centrality of graph vertices
• Axioms for Centrality
• Efficient computation of the Shapley value for game-theoretic network centrality
• Graphs and Cooperation in Games
• Importance of Agents in Networks: Clique Based Game-Theoretic Approach
• Modeling of the City’s Transport Network Using Game-Theoretic Methods on the Example of Petrozavodsk
• Networking games. Network forming games and games on networks
• Social and economic networks.
• The centrality index of a graph

Cited in

(2)

• Game theoretic centrality of a directed graph vertices
• Centrality measures and opinion dynamics in two-layer networks with replica nodes

This page was built for publication: Game-theoretic centrality of directed graph vertices

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