Existence theorems and approximation algorithms for generalized network security games

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2010, Pages 348-357

  Kumar, V S Anil ^b   Rajaraman, Rajmohan ^a   Sun, Zhifeng ^a   Sundaram, Ravi ^a  

^a Northeastern University   (United States)

^b VIRGINIA BIOINFORMATICS INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANTIVIRUS SOFTWARES; APPROXIMATION BOUNDS; ARBITRARY DISTRIBUTION; BEST RESPONSE; CONTACT NETWORKS; EXISTENCE THEOREM; GENERALIZED NETWORKS; GLOBAL MODELS; INSTALLATION COSTS; INTRINSIC NATURE; LINEAR TIME; MAXIMUM DEGREE; NATURAL HEURISTICS; NEIGHBORHOOD INFORMATION; NETWORK LOCALITY; NETWORK NODE; NETWORK PLANNERS; NP COMPLETE; NP COMPLETE PROBLEMS; OPTIMAL CONFIGURATIONS; POWER LAW GRAPHS; PRICE OF ANARCHY; PURE NASH EQUILIBRIUM; RANDOM GEOMETRIC GRAPHS; REAL-WORLD NETWORKS; SECURITY BREACHES; SOCIAL COST; SOCIAL OPTIMUMS; SPREAD OF VIRUS; STRATEGIC DECISIONS; THEORETICAL BOUNDS;

AD HOC NETWORKS; COMPUTATIONAL COMPLEXITY; COMPUTER VIRUSES; CONGESTION CONTROL (COMMUNICATION); COSTS; NETWORK SECURITY; TELECOMMUNICATION NETWORKS; VIRUSES;

APPROXIMATION ALGORITHMS;

EID: 77955900410     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2010.70     Document Type: Conference Paper

References (27)

1. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proceedings of STOC, 2004.
2. J. Aspnes, K.L. Chang, and A. Yampolskiy. Inoculation strategies for victims of viruses and the sum-of-squares partition problem. J. Comput. Syst. Sci., 2006.
3. J. Aspnes, N. Rustagi, and J. Saia. Worm versus alert: Who wins in a battle for control of a large-scale network? In OPODIS, 2007.
4. A.L. Barabási and R. Albert. Emergence of scaling in random networks. In Science, 1999.
5. M. Barthelemy, A. Barrat, R. Pastor-Satorras, and A.Vespignani. Dynamical patterns of epidemic outbreaks in complex heterogeneous networks. Journal of Theoretical Biology, 2005.
6. C. Bauch, A. Galvani, and D. Earn. Group interest versus self-interest in smallpox vaccination policy. PNAS, 2003.
7. C.T. Bauch. Imitation dynamics predict vaccinating behaviour. In Proceeding of The Royal Society, 2005.
8. C.T. Bauch and D.J.D. Earn. Vaccination and the theory of games. PNAS, 2004.
9. N. Berger, C. Borgs, J.T. Chayes, and A. Saberi. On the spread of viruses on the internet. In Proceedings of SODA, 2005.
10. O.V. Borodin, A.V. Kostochka, and B. Toft. Variable degeneracy: Extensions of Brooks' and Gallai's theorems. Discrete Mathematics, 2000.
11. H. Ebel, L.I. Mielsch, and S. Bornholdt. Scale-free topology of e-mail networks. Phys. Rev. E, 2002.
12. S. Eidenbenz, V.S. Anil Kumar, and S. Zust. Equilibria in topology control games for ad hoc networks. MONET, 2006.
13. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In Proceedings of SIGCOMM, 1999.
14. U. Feige. Vertex cover is hardest to approximate on regular graphs. Technical Report MCS03-15, The Weizmann Institute of Science, 2003.
15. A. Ganesh, L. Massoulie, and D. Towsley. The effect of network topology on the spread of epidemics. In INFOCOM, 2005.
16. N. Garg, V.V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing, 1993.
17. J. Grossklags, N. Christin, and J. Chuang. Secure or insure? a game-theoretic analysis of information security games. In WWW, 2008.
18. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. J. ACM, 2004.
19. M. Kearns and L. Ortiz. Algorithms for interdependent security games. In Advances in Neural Information Processing Systems, 2004.
20. David A. Kessler. Epidemic size in the SIS model of endemic infections. J. Appl. Probab., 2008.
21. E. Koutsoupias and C.H. Papadimitriou. Worst-case equilibria. In Proceedings of STACS, 1999.
22. M. Lelarge and J. Bolot. Economic incentives to increase security in the internet: The case for insurance. In INFOCOM, 2009.
23. A. Nahir and A. Orda. Topology design and control: A game-theoretic perspective. In INFOCOM, 2009.
24. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 2008.
25. J. Omic, A. Orda, and P. Mieghem. Protecting against network infections: A game theoretic perspective. In INFOCOM, 2009.
26. T. Roughgarden and E. Tardos. How bad is selfish routing? J. ACM, 2002.
27. Yang Wang, Deepayan Chakrabarti, Chenxi Wang, and Christos Faloutsos. Epidemic spreading in real networks: An eigenvalue viewpoint. In SRDS, 2003.