Toward Robust Monitoring of Malicious Outbreaks

References

• Anagnostakis KG, Greenwald MB, Ioannidis S, Keromytis AD (2007) Coverage: Detecting and reacting to worm epidemics using cooperation and validation. Internat. J. Inform. Security 6(6):361–378.Crossref, Google Scholar
• Bailey NTJ (1975) The Mathematical Theory of Infectious Diseases and Its Applications (Charles Griffin & Company Ltd., Bucks UK).Google Scholar
• Basilico N, Gatti N (2011) Automated abstractions for patrolling security games. AAAI Conf. Artificial Intelligence (AAAI), 1096–1101.Crossref, Google Scholar
• Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. Internat. Workshop Web Internet Econom. (Springer), 306–311.Google Scholar
• Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. Internat. Workshop Internet Network Econom. (Springer), 539–550.Google Scholar
• Domingos P, Richardson M (2001) Mining the network value of customers. Proc. Seventh ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM), 57–66.Google Scholar
• Durrett R (1988) Lecture Notes on Particle Systems and Percolation (Wadsworth Publishing Company).Google Scholar
• Fan L, Lu Z, Wu W, Thuraisingham B, Ma H, Bi Y (2013) Least cost rumor blocking in social networks. 2013 IEEE 33rd Internat. Conf. Distributed Comput. Systems (IEEE), 540–549.Google Scholar
• Garey MR, Johnson DS (1990) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman & Co., New York).Google Scholar
• Haghtalab N, Laszka A, Procaccia AD, Vorobeychik Y, Koutsoukos X (2015) Monitoring stealthy diffusion. 2015 IEEE Internat. Conf. Data Mining (IEEE), 151–160.Google Scholar
• Halvorson E, Conitzer V, Parr R (2009) Multi-step multi-sensor hider-seeker games. Proc. 21st Internat. Joint Conf. Artifical Intelligence, vol. 9, 159–166.Google Scholar
• He X, Kempe D (2014) Stability of influence maximization. Proc. 20th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM), 1256–1265.Google Scholar
• He X, Kempe D (2016) Robust influence maximization. Proc. 22nd ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 885–894.Google Scholar
• He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. SDM (SIAM), 463–474.Crossref, Google Scholar
• Howard NJ (2010) Finding optimal strategies for influencing social networks in two player games. Unpublished PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Jain M, Korzhyk D, Vaněk O, Conitzer V, Pěchouček M, Tambe M (2011) A double oracle algorithm for zero-sum security games on graphs. 10th Internat. Conf. Autonomous Agents Multiagent Systems, vol. 1 (International Foundation for Autonomous Agents and Multiagent Systems), 327–334.Google Scholar
• Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. Proc. Ninth ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM), 137–146.Google Scholar
• Kwon S, Cha M, Jung K, Chen W, Wang Y (2013) Prominent features of rumor propagation in online social media. 2013 IEEE 13th Internat. Conf. Data Mining (IEEE), 1103–1108.Google Scholar
• Liggett T (2012) Interacting Particle Systems, vol. 276 (Springer Science & Business Media).Google Scholar
• Lou J-K, Wang F-M, Tsai C-H, Hung S-C, Kung P-H, Lin S-D, Chen K-T, Lei C-L (2014) A social diffusion model with an application on election simulation. Sci. World J 2014:180590.Google Scholar
• McMahan HB, Gordon GJ (2003) Planning in cost-paired Markov decision process games. NIPS Workshop: Planning Real-World, vol. 3.Google Scholar
• McMahan HB, Gordon GJ, Blum A (2003) Planning in the presence of cost functions controlled by an adversary. ICML, 536–543.Google Scholar
• Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions. Math. Programming 14(1):265–294.Crossref, Google Scholar
• Omic J, Orda A, Van Mieghem P (2009) Protecting against network infections: A game theoretic perspective. 28th Annual Conf. IEEE INFOCOM 2009 (IEEE).Google Scholar
• Schrijver A (2003) Combinatorial Optimization: Polyhedra and Efficiency, vol. 24 (Springer Science & Business Media).Google Scholar
• Shah D, Zaman T (2011) Rumors in a network: Who’s the culprit? IEEE Trans. Inform. Theory 57(8):5163–5181.Crossref, Google Scholar
• Shelke S, Attar V (2019) Source detection of rumor in social network–a review. Online Soc. Networks Media 9:30–42.Crossref, Google Scholar
• Tang S, Yuan J (2020) Influence maximization with partial feedback. Oper. Res. Lett. 48(1):24–28.Crossref, Google Scholar
• Tsai J, Nguyen TH, Tambe M (2012) Security games for controlling contagion. AAAI.Google Scholar
• Washburn A, Wood K (1995) Two-person zero-sum games for network interdiction. Oper. Res. 43(2):243–251.Link, Google Scholar
• Wilder B, Yadav A, Immorlica N, Rice E, Tambe M (2017) Uncharted but not uninfluenced: Influence maximization with an uncertain network. AAMAS, vol. 17, 1305–1313.Google Scholar
• Yuan J, Tang S (2017) No time to observe: Adaptive influence maximization with partial feedback. Proc. 26th Internat. Joint Conf. Artificial Intelligence, 3908–3914.Google Scholar