Axiomatic Characterization of Game-Theoretic Network Centralities

Speaker(s)

Oskar Skibski

Affiliation

Instytut Informatyki, UW

Date

March 9, 2017, 10:15 a.m.

Room

room 1780

Seminar

Seminar Games, Mechanisms, and Social Networks

---

In this work, we focus on the game-theoretic approach to centrality analysis. While various centrality indices have been proposed based on this approach, it is still unknown what distinguishes this family of indices from the more classical ones. In this paper, we answer this question by providing the first axiomatic characterization of game-theoretic centralities. Specifically, we show that every centrality can be obtained following the game-theoretic approach, and show that two natural classes of game-theoretic centrality can be characterized by two intuitive properties pertaining to Myerson's notion of Fairness.

---