A Fast Literature Search Engine based on top-quality journals, by Dr. Mingze Gao.

  • Topic classification is ongoing.
  • Please kindly let me know [mingze.gao@mq.edu.au] in case of any errors.

Your search

In authors or contributors
  • This paper studies the extent to which centrality measures share a common structure. In contrast with prior work, I take an ordinal approach, defining centrality measures as preorders that satisfy an axiom called recursive monotonicity. From this axiom, I derive two fundamental measures, strong and weak centrality, and I relate these to the equilibria of network games. Any equilibrium in a game of strategic complements implicitly orders the players by their actions. Strong centrality captures comparisons shared across all equilibria in all such games. Weak centrality captures comparisons shared across minimal and maximal equilibria in all such games.

Last update from database: 7/26/24, 11:00 PM (AEST)

Explore