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

社交网络中信息暴露的平衡

Balancing Information Exposure in Social Networks

Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti

摘要:

社交媒体给人们消费新闻的方式带来了一场革命。除了社交媒体平台无疑带来的大量优势之外,批评的一个焦点是由社交同质性和算法个性化造成的回音室和过滤泡沫。在本文中,我们解决的问题,在社会网络中的信息曝光的平衡。我们假设网络中存在两个对立的运动(或观点),并且网络节点对这些运动有不同的偏好。我们的目标是找到两组节点用于各自的活动,以便两个活动的整体信息曝光是平衡的。我们正式定义的问题,其硬度的特点,开发近似算法,并提出实验评估结果。我们的模型受到了影响力最大化文献的启发,但我们提供了显着的新颖性。首先,信息暴露的平衡是由一个对称的差分函数,这是既不是单调的,也不是submodular,因此,不服从现有的方法。其次,虽然以前的论文考虑了自私代理的设置,并提供了最佳响应策略的界限(即,移动的最后一个球员),我们认为一个集中式代理的设置,并提供一个全球目标函数的界限。

英文摘要:

Social media has brought a revolution on how people are consuming news. Beyond the undoubtedly large number of advantages brought by social-media platforms, a point of criticism has been the creation of echo chambers and filter bubbles, caused by social homophily and algorithmic personalization. In this paper we address the problem of balancing the information exposure in a social network. We assume that two opposing campaigns (or viewpoints) are present in the network, and that network nodes have different preferences towards these campaigns. Our goal is to find two sets of nodes to employ in the respective campaigns, so that the overall information exposure for the two campaigns is balanced. We formally define the problem, characterize its hardness, develop approximation algorithms, and present experimental evaluation results. Our model is inspired by the literature on influence maximization, but we offer significant novelties. First, balance of information exposure is modeled by a symmetric difference function, which is neither monotone nor submodular, and thus, not amenable to existing approaches. Second, while previous papers consider a setting with selfish agents and provide bounds on best response strategies (i.e., move of the last player), we consider a setting with a centralized agent and provide bounds for a global objective function.

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

↑