arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.07454cs.SI
收藏

基于评分规则的社会影响力控制选举

Exploiting Social Influence to Control Elections Based on Scoring Rules

Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani

摘要:

在线社交网络用于在用户之间传播意见和想法,从而实现更快的通信和更广泛的受众。人们的意见受到社会互动影响的方式通常被称为社会影响。在政治竞选中,社会影响力被广泛用于宣传和支持候选人。在这里,我们考虑的问题,利用社会影响力的选民网络,以改变他们对目标候选人的意见,目的是增加他的机会,赢得/失去了在广泛的投票系统的选举。我们引入了线性阈值排名,这是一个自然而强大的扩展,它是一个成熟的线性阈值模型,它描述了考虑到行使影响力的意见变化。我们能够最大限度地提高得分的目标候选人高达一个因素的$1-1/e$通过显示子模块。利用这一性质,我们提出了一种求解构造性选举控制问题的$\frac{1}{3}(1-1/e)$ -近似算法.类似地,我们在破坏性场景中得到$\frac{1}{2}(1-1/e)$近似比。该算法可用于任意评分规则的投票系统,包括复数规则和Borda计数。最后,我们在真实网络上进行了实验研究,测量了目标候选者的胜利概率(PoV)和胜利幅度(MoV),以验证模型并测试算法的能力。

英文摘要:

Online social networks are used to diffuse opinions and ideas among users, enabling a faster communication and a wider audience. The way in which opinions are conditioned by social interactions is usually called social influence. Social influence is extensively used during political campaigns to advertise and support candidates. Herein we consider the problem of exploiting social influence in a network of voters in order to change their opinion about a target candidate with the aim of increasing his chance to win/lose the election in a wide range of voting systems. We introduce the Linear Threshold Ranking, a natural and powerful extension of the well-established Linear Threshold Model, which describes the change of opinions taking into account the amount of exercised influence. We are able to maximize the score of a target candidate up to a factor of $1-1/e$ by showing submodularity. We exploit such property to provide a $\frac{1}{3}(1-1/e)$-approximation algorithm for the constructive election control problem. Similarly, we get a $\frac{1}{2}(1-1/e)$-approximation ratio in the destructive scenario. The algorithm can be used in arbitrary scoring rule voting systems, including plurality rule and borda count. Finally, we perform an experimental study on real-world networks, measuring Probability of Victory (PoV) and Margin of Victory (MoV) of the target candidate, to validate the model and to test the capability of the algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑