Balancing information exposure in social networks
Loading...
Access rights
openAccess
acceptedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
9
Series
Advances in Neural Information Processing Systems 30: Proceedings of NIPS2017, pp. 4666-4674, Advances in Neural Information Processing Systems ; Volume 30
Abstract
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.Description
| openaire: EC/H2020/654024/EU//SoBigData
Keywords
Other note
Citation
Garimella, K, Gionis, A, Parotsidis, N & Tatti, N 2017, Balancing information exposure in social networks. in I Guyon, U V Luxburg, S Bengio, H Wallach, R Fergus, S Vishwanathan & R Garnett (eds), Advances in Neural Information Processing Systems 30 : Proceedings of NIPS2017. Advances in Neural Information Processing Systems, vol. 30, Curran Associates Inc., pp. 4666-4674, IEEE Conference on Neural Information Processing Systems, Long Beach, California, United States, 04/12/2017. < http://papers.nips.cc/paper/7052-balancing-information-exposure-in-social-networks.pdf >