Existence Theorems and Approximation Algorithms for Generalized Network Security Games

Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to install anti-virus software or not on an individual basis while the viruses or worms start from a node chosen uniformly at random and spread along paths consisting of insecure nodes. They showed the surprising result that a pure Nash Equilibrium always exists when all nodes have identical installation costs and identical infection costs. In this paper we present a substantial generalization of the model of [2] that allows for arbitrary security and infection costs, and arbitrary distributions for the starting point of the attack. More significantly, our model GNS(d) incorporates a network locality parameter d which represents a hop-limit on the spread of infection as accounted for in the strategic decisions, due to either the intrinsic nature of the infection or the extent of neighborhood information that is available to a node. We determine that the network locality parameter plays a key role in the existence of pure Nash equilibria (NE): local (d = 1) and global games (d = ∞) have pure NE, while for GNS(d) games with 1

[1]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[2]  Ariel Orda,et al.  Topology Design and Control: A Game-Theoretic Perspective , 2009, IEEE INFOCOM 2009.

[3]  Alessandro Vespignani,et al.  Dynamical Patterns of Epidemic Outbreaks in Complex Heterogeneous Networks , 1999 .

[4]  Santosh S. Vempala,et al.  On clusterings: Good, bad and spectral , 2004, JACM.

[5]  Stephan Eidenbenz,et al.  Equilibria in Topology Control Games for Ad Hoc Networks , 2003, DIALM-POMC '03.

[6]  Donald F. Towsley,et al.  The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  Christos Faloutsos,et al.  Epidemic spreading in real networks: an eigenvalue viewpoint , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[8]  Mihalis Yannakakis,et al.  Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..

[9]  C. Bauch Imitation dynamics predict vaccinating behaviour , 2005, Proceedings of the Royal Society B: Biological Sciences.

[10]  James Aspnes,et al.  Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network? , 2007, OPODIS.

[11]  S. Bornholdt,et al.  Scale-free topology of e-mail networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  D. Earn,et al.  Vaccination and the theory of games. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[14]  D. Earn,et al.  Group interest versus self-interest in smallpox vaccination policy , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Po-An Chen,et al.  Better vaccination strategies for better people , 2010, EC '10.

[16]  Marc Lelarge,et al.  Economic Incentives to Increase Security in the Internet: The Case for Insurance , 2009, IEEE INFOCOM 2009.

[17]  David A. Kessler,et al.  Epidemic Size in the SIS Model of Endemic Infections , 2007, Journal of Applied Probability.

[18]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[19]  Nicolas Christin,et al.  Secure or insure?: a game-theoretic analysis of information security games , 2008, WWW.

[20]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[21]  James Aspnes,et al.  Inoculation strategies for victims of viruses and the sum-of-squares partition problem , 2005, SODA '05.

[22]  Alexandr V. Kostochka,et al.  Variable degeneracy: extensions of Brooks' and Gallai's theorems , 2000, Discret. Math..

[23]  Luis E. Ortiz,et al.  Algorithms for Interdependent Security Games , 2003, NIPS.

[24]  Piet Van Mieghem,et al.  Protecting Against Network Infections: A Game Theoretic Perspective , 2009, IEEE INFOCOM 2009.

[25]  Amin Saberi,et al.  On the spread of viruses on the internet , 2005, SODA '05.

[26]  Stephan Eidenbenz,et al.  Equilibria in Topology Control Games for Ad Hoc Networks , 2006, Mob. Networks Appl..

[27]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .