Minimizing the misinformation spread in social networks

Abstract The Influence Maximization Problem has been widely studied in recent years, due to rich application areas including marketing. It involves finding k nodes to trigger a spread such that the expected number of influenced nodes is maximized. The problem we address in this study is an extension of the reverse influence maximization problem, i.e., misinformation minimization problem where two players make decisions sequentially in the form of a Stackelberg game. The first player aims to minimize the spread of misinformation whereas the second player aims its maximization. Two algorithms, one greedy heuristic and one matheuristic, are proposed for the first player’s problem. In both of them, the second player’s problem is approximated by Sample Average Approximation, a well-known method for solving two-stage stochastic programming problems, that is augmented with a state-of-the-art algorithm developed for the influence maximization problem.

[1]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[2]  Weili Wu,et al.  Least Cost Rumor Blocking in Social Networks , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[3]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[4]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[5]  Masahiro Kimura,et al.  Blocking links to minimize contamination spread in a social network , 2009, TKDD.

[6]  I. K. Altinel,et al.  Influence Maximization With Deactivation In Social Networks , 2019, Eur. J. Oper. Res..

[7]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..

[8]  Madhav V. Marathe,et al.  Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks , 2010, ECML/PKDD.

[9]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[10]  Tanya Y. Berger-Wolf,et al.  Finding Spread Blockers in Dynamic Networks , 2008, SNAKDD.

[11]  Evren Güney,et al.  On the optimal solution of budgeted influence maximization problem in social networks , 2017, Operational Research.

[12]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[13]  Nam P. Nguyen,et al.  Containment of misinformation spread in online social networks , 2012, WebSci '12.

[14]  Li Pan,et al.  Scalable influence blocking maximization in social networks under competitive independent cascade models , 2017, Comput. Networks.

[15]  Noga Alon,et al.  Information Processing Letters a Note on Competitive Diffusion through Social Networks , 2022 .

[16]  Wei Chen,et al.  Scalable influence maximization for independent cascade model in large-scale social networks , 2012, Data Mining and Knowledge Discovery.

[17]  Matteo Fischetti,et al.  A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs , 2017, Oper. Res..

[18]  Divyakant Agrawal,et al.  Limiting the spread of misinformation in social networks , 2011, WWW.

[19]  Jing He,et al.  Blocking negative influential node set in social networks: From host perspective , 2015, 2015 International Conference on Collaboration Technologies and Systems (CTS).

[20]  J. Bard.  Some properties of the bilevel programming problem , 1991 .

[21]  Xiaokui Xiao,et al.  Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.

[22]  Zhoujun Li,et al.  Negative Influence Minimizing by Blocking Nodes in Social Networks , 2013, AAAI.

[23]  Xiaokui Xiao,et al.  Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.

[24]  Masahiro Kimura,et al.  Solving the Contamination Minimization Problem on Networks for the Linear Threshold Model , 2008, PRICAI.

[25]  Sinan Aral,et al.  The spread of true and false news online , 2018, Science.

[26]  Stefan M. Wild,et al.  Maximizing influence in a competitive social network: a follower's perspective , 2007, ICEC.

[27]  Charles E. Blair,et al.  Computational Difficulties of Bilevel Linear Programming , 1990, Oper. Res..

[28]  Roger Wattenhofer,et al.  Word of Mouth: Rumor Dissemination in Social Networks , 2008, SIROCCO.

[29]  Radha Poovendran,et al.  Maximizing Influence in Competitive Environments: A Game-Theoretic Approach , 2011, GameSec.

[30]  Wei Chen,et al.  Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model , 2011, SDM.

[31]  Li Guo,et al.  Topic-aware Social Influence Minimization , 2015, WWW.

[32]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[33]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  Simge Küçükyavuz,et al.  A two-stage stochastic programming approach for influence maximization in social networks , 2018, Comput. Optim. Appl..

[35]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

[36]  Shishir Bharathi,et al.  Competitive Influence Maximization in Social Networks , 2007, WINE.

[37]  Milind Tambe,et al.  Security Games for Controlling Contagion , 2012, AAAI.

[38]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[39]  Evangelos Markakis,et al.  A Game-Theoretic Analysis of a Competitive Diffusion Process over Social Networks , 2012, WINE.

[40]  Ted K. Ralphs,et al.  A Branch-and-cut Algorithm for Integer Bilevel Linear Programs , 2009 .

[41]  Samarth Swarup,et al.  Blocking Simple and Complex Contagion by Edge Removal , 2013, 2013 IEEE 13th International Conference on Data Mining.

[42]  Michael Kearns,et al.  Competitive contagion in networks , 2011, STOC '12.

[43]  My T. Thai,et al.  A cutting-plane algorithm for solving a weighted influence interdiction problem , 2014, Comput. Optim. Appl..

[44]  John Yen,et al.  Advances in Social Network Mining and Analysis , 2011 .

[45]  Julia L. Higle,et al.  Stochastic Programming: Optimization When Uncertainty Matters , 2005 .

[46]  Kyomin Jung,et al.  IRIE: Scalable and Robust Influence Maximization in Social Networks , 2011, 2012 IEEE 12th International Conference on Data Mining.

[47]  Allan Borodin,et al.  Threshold Models for Competitive Influence in Social Networks , 2010, WINE.

[48]  Xinbing Wang,et al.  DRIMUX: Dynamic Rumor Influence Minimization with User Experience in Social Networks , 2016, IEEE Transactions on Knowledge and Data Engineering.