skip to main content
10.1145/3459637.3482451acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Mitigating Negative Influence Diffusion is Hard

Published: 30 October 2021 Publication History

Abstract

The way how the influence of a set of users is diffused in a social network has been widely studied in the last decades. Most of the work focused on maximizing the spread of influence or the diffusion of information (e.g., a viral marketing message) starting from a set of initial nodes called seeds. Unfortunately, malicious users can use these algorithms to spread negative messages, consisting of racist or hateful contents, misinformation, or fake news. We consider a scenario in which a malicious entity, the attacker, spreads a negative message and another entity, the defender, tries to mitigate the effects of the negative message by spreading another message that invalidates the former with some evidence that its content is wrong. The attacker has the advantage of playing first, knowing that the defender will play afterward, while the defender has the advantage of observing the attacker's spread. We define two optimization problems: the attacker, who is aware of the defender and her budget, selects a set of seeds to maximize the number of influenced nodes; when the attacker's diffusion process is finished, the defender selects her own seeds with the aim of minimizing the number of nodes that remain influenced by the attacker.

Supplementary Material

MP4 File (CIKM2021_rgfp1568.mp4)
The presentation video of the paper entitled "Mitigating Negative Influence Diffusion is Hard" in CIKM21

References

[1]
Vincenzo Auletta, Giuseppe De Nittis, Diodato Ferraioli, Nicola Gatti, and Domenico Longo. 2020. Strategic Monitor Placement Against Malicious Flows. In ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020) (Frontiers in Artificial Intelligence and Applications, Vol. 325), Giuseppe De Giacomo, Alejandro Catalá, Bistra Dilkina, Michela Milano, Sené n Barro, Alberto Bugar'i n, and Jé rô me Lang (Eds.). IOS Press, 11--18. https://doi.org/10.3233/FAIA200070
[2]
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, and Hugo Gilbert. 2020. Fairness in Influence Maximization through Randomization. CoRR, Vol. abs/2010.03438 (2020). arxiv: 2010.03438 https://arxiv.org/abs/2010.03438
[3]
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, and Hugo Gilbert. 2021. Fairness in Influence Maximization through Randomization. In Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Vol. 35. AAAI Press, 14684--14692. https://ojs.aaai.org/index.php/AAAI/article/view/17725
[4]
Shishir Bharathi, David Kempe, and Mahyar Salek. 2007. Competitive Influence Maximization in Social Networks. In Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12--14, 2007, Proceedings (Lecture Notes in Computer Science, Vol. 4858), Xiaotie Deng and Fan Chung Graham (Eds.). Springer, 306--311. https://doi.org/10.1007/978--3--540--77105-0_31
[5]
Allan Borodin, Yuval Filmus, and Joel Oren. 2010. Threshold Models for Competitive Influence in Social Networks. In Internet and Network Economics - 6th International Workshop, WINE 2010, Stanford, CA, USA, December 13--17, 2010. Proceedings (Lecture Notes in Computer Science, Vol. 6484), Amin Saberi (Ed.). Springer, 539--550. https://doi.org/10.1007/978--3--642--17572--5_48
[6]
Ceren Budak, Divyakant Agrawal, and Amr El Abbadi. 2011. Limiting the spread of misinformation in social networks. In Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011, Sadagopan Srinivasan, Krithi Ramamritham, Arun Kumar, M. P. Ravindra, Elisa Bertino, and Ravi Kumar (Eds.). ACM, 665--674. https://doi.org/10.1145/1963405.1963499
[7]
Tim Carnes, Chandrashekhar Nagarajan, Stefan M. Wild, and Anke van Zuylen. 2007. Maximizing influence in a competitive social network: a follower's perspective. In Proceedings of the 9th International Conference on Electronic Commerce: The Wireless World of Electronic Commerce, 2007, University of Minnesota, Minneapolis, MN, USA, August 19--22, 2007 (ACM International Conference Proceeding Series, Vol. 258), Maria L. Gini, Robert J. Kauffman, Donna Sarppo, Chrysanthos Dellarocas, and Frank Dignum (Eds.). ACM, 351--360. https://doi.org/10.1145/1282100.1282167
[8]
Wei Chen, Laks V. S. Lakshmanan, and Carlos Castillo. 2013. Information and Influence Propagation in Social Networks .Morgan & Claypool Publishers. https://doi.org/10.2200/S00527ED1V01Y201308DTM037
[9]
Cora I Dua niasua, Vasile Tomict ua, Dragocs Stuparu, and Marieta Stanciu. 2010. The mechanisms of the influence of viral marketing in social media. Economics, Management & Financial Markets, Vol. 5, 3 (2010), 278--282.
[10]
Pedro M. Domingos and Matthew Richardson. 2001. Mining the network value of customers. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, San Francisco, CA, USA, August 26--29, 2001, Doheon Lee, Mario Schkolnick, Foster J. Provost, and Ramakrishnan Srikant (Eds.). ACM, 57--66. https://doi.org/10.1145/502512.502525
[11]
Xinran He, Guojie Song, Wei Chen, and Qingye Jiang. 2012. Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model. In Proceedings of the Twelfth SIAM International Conference on Data Mining, Anaheim, California, USA, April 26--28, 2012. SIAM / Omnipress, 463--474. https://doi.org/10.1137/1.9781611972825.40
[12]
Mehdi Hemmati, J. Cole Smith, and My T. Thai. 2014. A cutting-plane algorithm for solving a weighted influence interdiction problem. Comput. Optim. Appl., Vol. 57, 1 (2014), 71--104. https://doi.org/10.1007/s10589-013--9589--9
[13]
Feiran Jia, Kai Zhou, Charles A. Kamhoua, and Yevgeniy Vorobeychik. 2020. Blocking Adversarial Influence in Social Networks. In Decision and Game Theory for Security - 11th International Conference, GameSec 2020, College Park, MD, USA, October 28--30, 2020, Proceedings (Lecture Notes in Computer Science, Vol. 12513), Quanyan Zhu, John S. Baras, Radha Poovendran, and Juntao Chen (Eds.). Springer, 257--276. https://doi.org/10.1007/978--3-030--64793--3_14
[14]
Andreas M Kaplan and Michael Haenlein. 2012. The Britney Spears universe: Social media and viral marketing at its best. Business Horizons, Vol. 55, 1 (2012), 27--31.
[15]
David Kempe, Jon M. Kleinberg, and É va Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24 - 27, 2003, Lise Getoor, Ted E. Senator, Pedro M. Domingos, and Christos Faloutsos (Eds.). ACM, 137--146. https://doi.org/10.1145/956750.956769
[16]
David Kempe, Jon M. Kleinberg, and É va Tardos. 2015. Maximizing the Spread of Influence through a Social Network. Theory Comput., Vol. 11 (2015), 105--147. https://doi.org/10.4086/toc.2015.v011a004
[17]
Elias Boutros Khalil, Bistra Dilkina, and Le Song. 2014. Scalable diffusion-aware optimization of network topology. In The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '14, New York, NY, USA - August 24 - 27, 2014, Sofus A. Macskassy, Claudia Perlich, Jure Leskovec, Wei Wang, and Rayid Ghani (Eds.). ACM, 1226--1235. https://doi.org/10.1145/2623330.2623704
[18]
Masahiro Kimura, Kazumi Saito, and Hiroshi Motoda. 2008. Solving the Contamination Minimization Problem on Networks for the Linear Threshold Model. In PRICAI 2008: Trends in Artificial Intelligence, 10th Pacific Rim International Conference on Artificial Intelligence, Hanoi, Vietnam, December 15--19, 2008. Proceedings (Lecture Notes in Computer Science, Vol. 5351), Tu Bao Ho and Zhi-Hua Zhou (Eds.). Springer, 977--984. https://doi.org/10.1007/978--3--540--89197-0_94
[19]
Masahiro Kimura, Kazumi Saito, and Hiroshi Motoda. 2009. Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discov. Data, Vol. 3, 2 (2009), 9:1--9:23. https://doi.org/10.1145/1514888.1514892
[20]
Jan Kostka, Yvonne Anne Oswald, and Roger Wattenhofer. 2008. Word of Mouth: Rumor Dissemination in Social Networks. In Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17--20, 2008, Proceedings (Lecture Notes in Computer Science, Vol. 5058), Alexander A. Shvartsman and Pascal Felber (Eds.). Springer, 185--196. https://doi.org/10.1007/978--3--540--69355-0_16
[21]
Rohan Miller and Natalie Lammas. 2010. Social media and its implications for viral marketing. Asia Pacific Public Relations Journal, Vol. 11, 1 (2010), 1--9.
[22]
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions-I. Mathematical programming, Vol. 14, 1 (1978), 265--294.
[23]
Nam P. Nguyen, Guanhua Yan, My T. Thai, and Stephan J. Eidenbenz. 2012. Containment of misinformation spread in online social networks. In Web Science 2012, WebSci '12, Evanston, IL, USA - June 22 - 24, 2012, Noshir S. Contractor, Brian Uzzi, Michael W. Macy, and Wolfgang Nejdl (Eds.). ACM, 213--222. https://doi.org/10.1145/2380718.2380746
[24]
Matthew Richardson and Pedro M. Domingos. 2002. Mining knowledge-sharing sites for viral marketing. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23--26, 2002, Edmonton, Alberta, Canada. ACM, 61--70. https://doi.org/10.1145/775047.775057
[25]
Kü bra Taninmis, Necati Aras, and I. Kuban Altinel. 2019. Influence maximization with deactivation in social networks. Eur. J. Oper. Res., Vol. 278, 1 (2019), 105--119. https://doi.org/10.1016/j.ejor.2019.04.010
[26]
Kübra Taninmics, Necati Aras, .I Kuban Altinel, and Evren Güney. 2020. Minimizing the misinformation spread in social networks. IISE Transactions, Vol. 52, 8 (2020), 850--863.
[27]
Jason Tsai, Thanh Hong Nguyen, and Milind Tambe. 2012. Security Games for Controlling Contagion. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22--26, 2012, Toronto, Ontario, Canada, Jö rg Hoffmann and Bart Selman (Eds.). AAAI Press. http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/5014
[28]
Jason Tsai, Yundi Qian, Yevgeniy Vorobeychik, Christopher Kiekintveld, and Milind Tambe. 2013. Bayesian Security Games for Controlling Contagion. In International Conference on Social Computing, SocialCom 2013, SocialCom/PASSAT/BigData/EconCom/BioMedCom 2013, Washington, DC, USA, 8--14 September, 2013. IEEE Computer Society, 33--38. https://doi.org/10.1109/SocialCom.2013.11
[29]
Christopher Umans. 1999. Hardness of Approximating Σ_2^p Minimization Problems. In 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17--18 October, 1999, New York, NY, USA. IEEE Computer Society, 465--474. https://doi.org/10.1109/SFFCS.1999.814619
[30]
Yevgeniy Vorobeychik and Joshua Letchford. 2015. Securing interdependent assets. Auton. Agents Multi Agent Syst., Vol. 29, 2 (2015), 305--333. https://doi.org/10.1007/s10458-014--9258-0
[31]
Chi Wang, Wei Chen, and Yajun Wang. 2012. Scalable influence maximization for independent cascade model in large-scale social networks. Data Min. Knowl. Discov., Vol. 25, 3 (2012), 545--576. https://doi.org/10.1007/s10618-012-0262--1
[32]
Bryan Wilder and Yevgeniy Vorobeychik. 2019. Defending Elections against Malicious Spread of Misinformation. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019. AAAI Press, 2213--2220. https://doi.org/10.1609/aaai.v33i01.33012213
[33]
Huiling Zhang, Md Abdul Alim, My T. Thai, and Hien T. Nguyen. 2015. Monitor placement to timely detect misinformation in Online Social Networks. In 2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8--12, 2015. IEEE, 1152--1157. https://doi.org/10.1109/ICC.2015.7248478

Index Terms

  1. Mitigating Negative Influence Diffusion is Hard

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management
      October 2021
      4966 pages
      ISBN:9781450384469
      DOI:10.1145/3459637
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 30 October 2021

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. approximation algorithms
      2. computational complexity
      3. influence maximization
      4. polynomial hierarchy
      5. social influence
      6. social networks
      7. stackelberg games

      Qualifiers

      • Research-article

      Funding Sources

      • This work was partially supported by the Italian MIUR PRIN 2017 Project ``ALGADIMAR' Algorithms Games and Digital Markets.

      Conference

      CIKM '21
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

      Upcoming Conference

      CIKM '25

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 143
        Total Downloads
      • Downloads (Last 12 months)23
      • Downloads (Last 6 weeks)4
      Reflects downloads up to 20 Jan 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media