Modified Myerson value for determining the centrality of graph vertices

MaRDI QIDQ5240346zbMATH OpenFDO

Authors V. A. Khitraya, Vladimir V. Mazalov

Publication date 25 October 2019

Full work available at URL http://mathnet.ru/eng/mgta234

zbMATH Keywords

centrality measurecooperative gameMyerson valuenetworkspaths with cycles

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Social networks; opinion dynamics (91D30)

Recommendations

• A modified Myerson value for determining the centrality of graph vertices
• Game-theoretic centrality measures for weighted graphs
• 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
• A class of social-Shapley values of cooperative games with graph structure

Cites work

• Efficient computation of the Shapley value for game-theoretic network centrality
• Generating functions and the Myerson vector in communication networks
• Graphs and Cooperation in Games
• scientific article; zbMATH DE number 4172789 (Why is no real title available?)
• Networking games. Network forming games and games on networks
• STACS 2005

Cited in

(7)

• Cooperative game theory approaches for network partitioning
• A modified Myerson value for determining the centrality of graph vertices
• Game-theoretic centrality measures for weighted graphs
• Method for determination of the social graph orientation by the analysis of the vertices valence in the connectivity component
• Game theoretic centrality of a directed graph vertices
• Game-theoretic centrality of directed graph vertices
• The cohesiveness of subgroups in social networks: A view from game theory

This page was built for publication: Modified Myerson value for determining the centrality of graph vertices

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