Game theoretic network centrality: exact formulas and efficient algorithms

Abstract

The concept of centrality plays an important role in network analysis. Game theoretic centrality measures have been recently proposed, which are based on computing the Shapley Value (SV) of each node (agent) in a suitably constructed co-operative network game (for example see [1]). However, the naive method of exact computation of SVs takes exponential time… (More)
DOI: 10.1145/1838206.1838431

Topics

1 Figure or Table

Slides referencing similar topics