Benders decomposition for competitive influence maximization in (social) networks

  • SCI-E
  • SSCI
作者: Kahr, Michael;Leitner, Markus;Ruthmair, Mario;Sinnl, Markus
作者机构: University of Vienna, Department of Statistics and Operations Research, Vienna, Austria
Johannes Kepler University Linz, Institute of Production and Logistics Management, Linz, Austria
Vrije Universiteit Amsterdam, Department of Supply Chain Analytics, Amsterdam, Netherlands
语种: 英文
关键词: Competitive influence maximization;Social networks;Integer linear programming;Benders decomposition
期刊: OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
ISSN: 0305-0483
年: 2021
卷: 100
页码: 102264-
基金类别: Vienna Science and Technology Fund [ICT15-014]; Federal Ministry of Education, Science and Research of Austria; Austrian Agency for International Mobility and Cooperation in Education, Science and Research [ICM-2019-13384]
摘要: Online social networks have become crucial to propagate information. Prominent use cases include marketing campaigns for products or political candidates in which maximizing the expected number of reached individuals is a common objective. The latter can be achieved by incentivizing an appropriately selected seed set of influencers that trigger an influence cascade with expected maximum impact. In real-world settings, competing influence spreads need to be considered frequently. These may, for in stance, stem from marketing activities for a substitute product of a different com pany or bad actors that spread (mis-)information about a political candidate. This article focuses on competitive settings in which the seed individuals of one entity are already known. Another entity wants to choose its seed set of individuals that triggers an influence cascade of maximum impact. The propagation process is modeled by a variant of the probabilistic independent cascade model. An algorithmic framework based on a Benders decomposition is developed that also employs preprocessing and initial heuristics. This framework is used within a sample average approximation scheme that allows to approximate the exact objective function value. The algorithms are tested on real-world instances from the literature and newly-obtained ones from Twitter. A computational study reports on the algorithms' performance next to providing further insights. The latter are based on analyzing expected losses that are caused by competition, the gain from solving subproblems to optimality using the Benders decomposition based algorithm, and the influence of different seed set choices of the first entity. (c) 2020 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/)

文件格式:
导出字段:
导出
关闭
Benders decomposition for competitive influence maximization in (social) networks
有问题请联系我们,邮箱:常见的失败原因