4.7 Article

Benders decomposition for competitive influence maximization in (social) networks

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.omega.2020.102264

关键词

Competitive influence maximization; Social networks; Integer linear programming; Benders decomposition

资金

  1. Vienna Science and Technology Fund [ICT15-014]
  2. Federal Ministry of Education, Science and Research of Austria
  3. Austrian Agency for International Mobility and Cooperation in Education, Science and Research [ICM-2019-13384]

向作者/读者索取更多资源

This article discusses the crucial role of online social networks in information propagation, and how to select a seed set of individuals with maximum impact in competitive environments to trigger influence cascades. It introduces a probabilistic model based on the independent cascade model and an algorithmic framework based on Benders decomposition, tested on real-world instances and newly-obtained data from Twitter. The study reports on the algorithms' performance and provides insights on expected losses from competition, gains from solving subproblems optimally, and the influence of seed set choices.
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/)

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据