Shadowing and shielding: Effective heuristics for continuous influence maximisation in the voting dynamics

Author:

Romero Moreno GuillermoORCID,Chakraborty Sukankana,Brede Markus

Abstract

Influence maximisation, or how to affect the intrinsic opinion dynamics of a social group, is relevant for many applications, such as information campaigns, political competition, or marketing. Previous literature on influence maximisation has mostly explored discrete allocations of influence, i.e. optimally choosing a finite fixed number of nodes to target. Here, we study the generalised problem of continuous influence maximisation where nodes can be targeted with flexible intensity. We focus on optimal influence allocations against a passive opponent and compare the structure of the solutions in the continuous and discrete regimes. We find that, whereas hub allocations play a central role in explaining optimal allocations in the discrete regime, their explanatory power is strongly reduced in the continuous regime. Instead, we find that optimal continuous strategies are very well described by two other patterns: (i) targeting the same nodes as the opponent (shadowing) and (ii) targeting direct neighbours of the opponent (shielding). Finally, we investigate the game-theoretic scenario of two active opponents and show that the unique pure Nash equilibrium is to target all nodes equally. These results expose fundamental differences in the solutions to discrete and continuous regimes and provide novel effective heuristics for continuous influence maximisation.

Funder

Alan Turing Institute

Royal Society

Army Research Laboratory

U.K. Ministry of Defence

Publisher

Public Library of Science (PLoS)

Subject

Multidisciplinary

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3