129 citations · 130 across the 2 of their papers we have counts for
2 papers
cs.GT2015★ 1 cited
Fast Algorithms for Game-Theoretic Centrality Measures
Piotr Lech Szczepański
In this dissertation, we analyze the computational properties of game-theoretic centrality measures. The key idea behind game-theoretic approach to network analysis is to treat nod…
cs.GT2014★ 129 cited
Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality
Tomasz Pawel Michalak, Karthik V Aadithya, Piotr L. Szczepanski +2
The Shapley value---probably the most important normative payoff division scheme in coalitional games---has recently been advocated as a useful measure of centrality in networks. H…