On the windfall of friendship: Inoculation strategies on social networks

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2008, Pages 294-301

  Meier, Dominic ^a   Oswald, Yvonne Anne ^a   Schmid, Stefan ^b   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Equilibria; Game theory; Social networks; Virus propagation; Windfall of friendship

Indexed keywords

NASH EQUILIBRIUM; NP-HARD; SOCIAL NETWORKS; SOCIAL WELFARE; VIRUS PROPAGATION;

ELECTRIC CONDUCTIVITY MEASUREMENT; ELECTRONIC COMMERCE; GAME THEORY; SOCIAL NETWORKING (ONLINE); VIRUSES;

COMPUTER VIRUSES;

EID: 71549172083     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1386790.1386836     Document Type: Conference Paper

References (29)

1. J. Aspnes, K. Chang, and A. Yampolskiy. Inoculation Strategies for Victims of Viruses and the Sum-of-Squares Partition Problem. In Proc. 16th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), 2005.
2. M. Babaioff, R. Kleinberg, and C. H. Papadimitriou. Congestion Games with Malicious Players. In Proc. 18th ACM Conference on Electronic Commerce (EC), 2007.
3. N. T. Bailey. The Mathematical Theory of Infectious Diseases and its Applications. Hafner Press, 1975.
4. R. Blundell, W. Newey, and T. Persson (Eds). Advances in Economics and Econometrics (Chapter 1: The Economics of Social Networks). 2006.
5. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker. On a Network Creation Game. In Proc. 22nd Annual Symposium on Principles of Distributed Computing (PODC), 2003.
6. J. Feigenbaum, C. H. Papadimitriou, and S. Shenker. Sharing the Cost of Multicast Transmissions. Journal of Computer and System Sciences, 63(1):21-41, 2001.
7. G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee. Self-Organization and Identification of Web Communities. Computer, 35(3):66-71, 2002.
8. C. Fleizach, M. Liljenstam, P. Johansson, G. M. Voelker, and A. Mehes. Can You Infect Me Now? Malware Propagation in Mobile Phone Networks. In Proc. 2007 ACM Workshop on Recurring Malcode (WORM), 2007.
9. P. Fraigniaud, C. Gavoille, and C. Paul. Eclecticism Shrinks Even Small Worlds. In Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), 2004.
10. J. C. Frauenthal. Mathematical Modeling in Epidemiology. Springer-Verlag, 1980.
11. M. R. Garey and D. S. Johnson. Computers and Intractability : A Guide to the Theory of NP-Completeness . W. H. Freeman, 1979.
12. S. M. Kakade, M. Kearns, and L. E. Ortiz. Graphical Economics. In Proc. 17th Annual Conference on Learning Theory (COLT), 2004.
13. R. M. Karp. Reducibility Among Combinatorial Problems. Complexity of Computer Computations, pages 85-103, 1972.
14. M. Kearns, M. Littman, and S. Singh. Graphical Models for Game Theory. In Proc. Conference on Uncertainty in Artificial Intelligence (UAI), 2001.
15. J. O. Kephart and S. R. White. Measuring and Modeling Computer Virus Prevalence. In Proc. IEEE Symposium on Security and Privacy, 1993.
16. J. O. Kephart, S. R. White, and D. M. Chess. Computers and Epidemiology. IEEE Spectrum, 30(5):20-26, 1993.
17. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proc. 32nd ACM Symposium on Theory of Computing (STOC), 2000.
18. J. Kleinberg. Complex Networks and Decentralized Search Algorithms. In Proc. International Congress of Mathematicians (ICM), 2006.
19. J. Kleinberg. Algorithmic Game Theory. Chapter 24 : Cascading Behavior in Networks: Algorithmic and Economic Issues. N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani (Eds), Cambridge University Press, 2007.
20. J. Leskovec, L. A. Adamic, and B. A. Huberman. The Dynamics of Viral Marketing. ACM Transactions on the Web, 2007.
21. D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins. Geographic Routing in Social Networks. In Proc. National Academy of Sciences, number 33, pages 11623-11628. National Acad Sciences, 2005.
22. G. S. Manku, M. Naor, and U. Wieder. Know thy Neighbor's Neighbor: the Power of Lookahead in Randomized P2P Networks. In Proc. 36th ACM Symposium on Theory of Computing (STOC), 2004.
23. S. Milgram. The Small World Problem. Psychology Today, pages 60-67, 1967.
24. T. Moscibroda, S. Schmid, and R. Wattenhofer. On the Topologies Formed by Selfish Peers. In Proc. 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2006.
25. T. Moscibroda, S. Schmid, and R. Wattenhofer. When Selfish Meets Evil: Byzantine Players in a Virus Inoculation Game. In Proc. 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2006.
26. M. E. J. Newman and M. Girvan. Finding and Evaluating Community Structure in Networks. Physical Review E, 69, 2004.
27. T. Roughgarden. Selfish Routing and the Price of Anarchy. MIT Press, 2005.
28. T. Roughgarden and Éva Tardos. How Bad is Selfish Routing? Journals of the ACM, 49(2):236-259, 2002.
29. C. Wang, J. C. Knight, and M. C. Elder. On Computer Viral Infection and the Effect of Immunization. In Proc. 16th Annual Computer Security Applications Conference (ACSAC), 2000.