Game-theoretic centrality measures for weighted graphs
From MaRDI portal
Publication:4976402
DOI10.3233/FI-2016-1364zbMATH Open1367.91157OpenAlexW2516714157MaRDI QIDQ4976402FDOQ4976402
Authors: Lyudmila I. Trukhina, B. T. Tsynguev, Vladimir V. Mazalov, Konstantin Avrachenkov 
Publication date: 28 July 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2016-1364
Recommendations
- Centrality and power in social networks: A game theoretic approach.
- Efficient algorithms for game-theoretic betweenness centrality
- Modified Myerson value for determining the centrality of graph vertices
- A modified Myerson value for determining the centrality of graph vertices
- A centrality measure for networks with community structure based on a generalization of the Owen value
Cited In (12)
- Game of thieves and WERW-Kpath: two novel measures of node and edge centrality for mafia networks
- Parallelization of game theoretic centrality algorithms
- Modified Myerson value for determining the centrality of graph vertices
- Efficient algorithms for game-theoretic betweenness centrality
- A modified Myerson value for determining the centrality of graph vertices
- Directed communication in games with directed graphs
- Analyzing the Zerkani network with the Owen value
- Some properties of transportation network cooperative games
- Centrality and power in social networks: A game theoretic approach.
- A centrality measure for networks with community structure based on a generalization of the Owen value
- On network analysis using non-additive integrals: extending the game-theoretic network centrality
- Hitting a path: a generalization of weighted connectivity via game theory
This page was built for publication: Game-theoretic centrality measures for weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976402)
