Dynamic competition over social networks

Article dans une revue: We propose an analytical approach to the problem of influence maximization in a social network where two players compete by means of dynamic targeting strategies. We formulate the problem as a two-player zero-sum stochastic game. We prove the existence of the uniform value: if the players are sufficiently patient, both can guarantee the same mean-average opinion without knowing the exact length of the game. Furthermore, we put forward some elements for the characterization of equilibrium strategies. In general, players must implement a trade-off between a forward-looking perspective, according to which they aim to maximize the future spread of their opinion in the network, and a backward-looking perspective, according to which they aim to counteract their opponent’s previous actions. When the influence potential of players is small, we describe an equilibrium through a one-shot game based on eigenvector centrality.

Auteur(s)

Antoine Mandel, Xavier Venel

Revue
  • European Journal of Operational Research
Date de publication
  • 2020
Mots-clés
  • Game theory
  • Social network
  • Dynamic games
  • Targeting
  • Stochastic games
Pages
  • 597-608
Version
  • 1
Volume
  • 280