We study a network formation game where agents receive benefits by forming connections to other agents but also incur both direct and indirect costs from the formed connections. Specifically, once the agents have purchased their connections, an attack starts at a randomly chosen vertex in the network and spreads according to the independent cascade model with a fixed probability, destroying any infected agents. The utility or welfare of an agent in our game is defined to be the expected size of the agent's connected component post-attack minus her expenditure in forming connections.
Our goal is to understand the properties of the equilibrium networks formed in this game. Our first result concerns the edge density of equilibrium networks. A network connection increases both the likelihood of remaining connected to other agents after an attack as well the likelihood of getting infected by a cascading spread of infection. We show that the latter concern primarily prevails and any equilibrium network in our game contains only $O(n\log n)$ edges where $n$ denotes the number of agents. On the other hand, there are equilibrium networks that contain $\Omega(n)$ edges showing that our edge density bound is tight up to a logarithmic factor. Our second result shows that the presence of attack and its spread through a cascade does not significantly lower social welfare as long as the network is not too dense. We show that any non-trivial equilibrium network with $O(n)$ edges has $\Theta(n^2)$ social welfare, asymptotically similar to the social welfare guarantee in the game without any attacks.
[1]
B. Bollobás.
The evolution of random graphs
,
1984
.
[2]
U. Dulleck,et al.
μ-σ Games
,
2012,
Games.
[3]
P. Erdos,et al.
On the evolution of random graphs
,
1984
.
[4]
Éva Tardos,et al.
Maximizing the Spread of Influence through a Social Network
,
2015,
Theory Comput..
[5]
Sanjeev Khanna,et al.
Strategic Network Formation with Attack and Immunization
,
2016,
WINE.
[6]
Anand Srivastav,et al.
Swap Equilibria under Link and Vertex Destruction
,
2017,
Games.
[7]
Shuliang Wang,et al.
Data Mining and Knowledge Discovery
,
2005,
Mathematical Principles of the Internet.
[8]
David Aldous.
Discrete probability and algorithms
,
1995
.
[9]
Sanjeev Goyal,et al.
A Noncooperative Model of Network Formation
,
2000
.
[10]
Noga Alon,et al.
A Note on Network Reliability
,
1995
.
[11]
Wei Chen,et al.
Scalable influence maximization for independent cascade model in large-scale social networks
,
2012,
Data Mining and Knowledge Discovery.
[12]
Srikanta Tirthapura,et al.
Proceedings of the 28th ACM symposium on Principles of distributed computing
,
2009,
PODC 2009.
[13]
Scott Shenker,et al.
On a network creation game
,
2003,
PODC '03.
[14]
Lasse Kliemann.
The Price of Anarchy for Network Formation in an Adversary Model
,
2011,
Games.
[15]
Laurent Massoulié,et al.
Epidemics and Rumours in Complex Networks: Index
,
2009
.
[16]
Tim Roughgarden,et al.
Proceedings of the 12th ACM conference on Electronic commerce
,
2011,
EC 2011.