Solution concepts from cooperative game theory, such as the Shapley value or the Banzhaf index, have recently been advocated as interesting extensions of standard measures of node centrality in networks. While this direction of research is promising, the computation of game-theoretic centrality can be challenging. In an attempt to address the computational issues of game-theoretic network centrality, we present a generic framework for constructing game-theoretic network centralities. We prove that all extensions that can be expressed in this framework are computable in polynomial time. Using our framework, we present the first game-theoretic extensions of weighted and normalized degree centralities, impact factor centrality, distance-scaled and normalized betweenness centrality, and closeness and normalized closeness centralities.
['Piotr L. Szczepański', 'Mateusz Krzysztof Tarkowski', 'Tomasz P. Michalak', 'Paul Harrenstein', 'Michael Wooldridge']
Efficient computation of semivalues for game-theoretic network centrality