TY - JOUR

T1 - Complexity of equilibrium in competitive diffusion games on social networks

AU - Etesami, Seyed Rasoul

AU - Başar, Tamer

N1 - Funding Information:
Research was supported in part by the “Cognitive & Algorithmic Decision Making” project grant through the College of Engineering of the University of Illinois , and in parts by AFOSR MURI Grant FA 9550-10-1-0573 and National Science Foundation grant CCF 11-11342 . The material in this paper was partially presented at the 2014 American Control Conference, June 4–6, 2014, Portland, OR, USA. This paper was recommended for publication in revised form by Associate Editor Giancarlo Ferrari-Trecate under the direction of Editor Ian R. Petersen.

PY - 2016

Y1 - 2016

N2 - In this paper, we consider the competitive diffusion game, and study the existence of its pure-strategy Nash equilibrium when defined over general undirected networks. We first determine the set of pure-strategy Nash equilibria for two special but well-known classes of networks, namely the lattice and the hypercube. Characterizing the utility of the players in terms of graphical distances of their initial seed placements to other nodes in the network, we show that in general networks the decision process on the existence of pure-strategy Nash equilibrium is an NP-hard problem. Following this, we provide some necessary conditions for a given profile to be a Nash equilibrium. Furthermore, we study players' utilities in the competitive diffusion game over Erdos-Renyi random graphs and show that as the size of the network grows, the utilities of the players are highly concentrated around their expectation, and are bounded below by some threshold based on the parameters of the network. Finally, we obtain a lower bound for the maximum social welfare of the game with two players, and study sub-modularity of the players' utilities.

AB - In this paper, we consider the competitive diffusion game, and study the existence of its pure-strategy Nash equilibrium when defined over general undirected networks. We first determine the set of pure-strategy Nash equilibria for two special but well-known classes of networks, namely the lattice and the hypercube. Characterizing the utility of the players in terms of graphical distances of their initial seed placements to other nodes in the network, we show that in general networks the decision process on the existence of pure-strategy Nash equilibrium is an NP-hard problem. Following this, we provide some necessary conditions for a given profile to be a Nash equilibrium. Furthermore, we study players' utilities in the competitive diffusion game over Erdos-Renyi random graphs and show that as the size of the network grows, the utilities of the players are highly concentrated around their expectation, and are bounded below by some threshold based on the parameters of the network. Finally, we obtain a lower bound for the maximum social welfare of the game with two players, and study sub-modularity of the players' utilities.

KW - Competitive diffusion game

KW - Erdos-Renyi graphs

KW - NP-hardness

KW - Pure-strategy Nash equilibrium

KW - Social welfare

KW - Sub-modular function

UR - http://www.scopus.com/inward/record.url?scp=84958824487&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958824487&partnerID=8YFLogxK

U2 - 10.1016/j.automatica.2016.01.063

DO - 10.1016/j.automatica.2016.01.063

M3 - Article

AN - SCOPUS:84958824487

VL - 68

SP - 100

EP - 110

JO - Automatica

JF - Automatica

SN - 0005-1098

ER -