English
Related papers

Related papers: Disincentivizing Polarization in Social Networks

200 papers

A topic propagating in a social network reaches its tipping point if the number of users discussing it in the network exceeds a critical threshold such that a wide cascade on the topic is likely to occur. In this paper, we consider the task…

Social and Information Networks · Computer Science 2014-06-19 Peng Zhang , Wei Chen , Xiaoming Sun , Yajun Wang , Jialin Zhang

A typical viral marketing model identifies influential users in a social network to maximize a single product adoption assuming unlimited user attention, campaign budgets, and time. In reality, multiple products need campaigns, users have…

Social and Information Networks · Computer Science 2017-01-31 Nan Du , Yingyu Liang , Maria-Florina Balcan , Manuel Gomez-Rodriguez , Hongyuan Zha , Le Song

Web search is an integral part of our daily lives. Recently, there has been a trend of personalization in Web search, where different users receive different results for the same search query. The increasing level of personalization is…

Computers and Society · Computer Science 2017-06-19 Anikó Hannák , Piotr Sapieżyński , Arash Molavi Khaki , David Lazer , Alan Mislove , Christo Wilson

Classical collaborative filtering, and content-based filtering methods try to learn a static recommendation model given training data. These approaches are far from ideal in highly dynamic recommendation domains such as news recommendation…

Machine Learning · Computer Science 2016-06-01 Shuai Li , Alexandros Karatzoglou , Claudio Gentile

This paper studies ranking policies in a stylized trial-offer marketplace model, in which a single firm offers products and has consumers with heterogeneous preferences. Consumer trials are influenced by past purchases and the ranking of…

Social and Information Networks · Computer Science 2021-02-11 Franco Berbeglia , Gerardo Berbeglia , Pascal Van Hentenryck

E-commerce sites strive to provide users the most timely relevant information in order to reduce shopping frictions and increase customer satisfaction. Multi armed bandit models (MAB) as a type of adaptive optimization algorithms provide…

Information Retrieval · Computer Science 2021-08-23 Ding Xiang , Becky West , Jiaqi Wang , Xiquan Cui , Jinzhou Huang

Online platforms have a wealth of data, run countless experiments and use industrial-scale algorithms to optimize user experience. Despite this, many users seem to regret the time they spend on these platforms. One possible explanation is…

Social and Information Networks · Computer Science 2023-10-24 Jon Kleinberg , Sendhil Mullainathan , Manish Raghavan

Algorithms that favor popular items are used to help us select among many choices, from engaging articles on a social media news feed to songs and books that others have purchased, and from top-raked search engine results to highly-cited…

Computers and Society · Computer Science 2026-05-19 Azadeh Nematzadeh , Giovanni Luca Ciampaglia , Filippo Menczer , Alessandro Flammini

Recommender systems are personalized: we expect the results given to a particular user to reflect that user's preferences. Some researchers have studied the notion of calibration, how well recommendations match users' stated preferences,…

Information Retrieval · Computer Science 2019-09-17 Kun Lin , Nasim Sonboli , Bamshad Mobasher , Robin Burke

Randomized experimentation (also known as A/B testing or bucket testing) is widely used in the internet industry to measure the metric impact obtained by different treatment variants. A/B tests identify the treatment variant showing the…

Personalized news recommendation systems inadvertently create information cocoons--homogeneous information bubbles that reinforce user biases and amplify societal polarization. To address the lack of comprehensive assessment frameworks in…

Information Retrieval · Computer Science 2025-09-16 Xin Wang , Xiaowen Huang , Jitao Sang

Most existing content-based filtering approaches learn user profiles independently without capturing the similarity among users. Bayesian hierarchical models \cite{Zhang:Efficient} learn user profiles jointly and have the advantage of being…

Information Retrieval · Computer Science 2014-12-30 Lanbo Zhang , Yi Zhang

Users online tend to join polarized groups of like-minded peers around shared narratives, forming echo chambers. The echo chamber effect and opinion polarization may be driven by several factors including human biases in information…

Social and Information Networks · Computer Science 2023-05-15 Carlo Michele Valensise , Matteo Cinelli , Walter Quattrociocchi

Social media and other platforms rely on automated detection of abusive content to help combat disinformation, harassment, and abuse. One common approach is to check user content for similarity against a server-side database of problematic…

Cryptography and Security · Computer Science 2021-10-06 Yiqing Hua , Armin Namavari , Kaishuo Cheng , Mor Naaman , Thomas Ristenpart

Many human-facing algorithms -- including those that power recommender systems or hiring decision tools -- are trained on data provided by their users. The developers of these algorithms commonly adopt the assumption that the data…

Computers and Society · Computer Science 2024-01-01 Sarah H. Cen , Andrew Ilyas , Aleksander Madry

Recommender systems usually face the issue of filter bubbles: overrecommending homogeneous items based on user features and historical interactions. Filter bubbles will grow along the feedback loop and inadvertently narrow user interests.…

Information Retrieval · Computer Science 2022-05-02 Wenjie Wang , Fuli Feng , Liqiang Nie , Tat-Seng Chua

Recommendation systems capable of providing diverse sets of results are a focus of increasing importance, with motivations ranging from fairness to novelty and other aspects of optimizing user experience. One form of diversity of recent…

Data Structures and Algorithms · Computer Science 2024-07-15 Jon Kleinberg , Emily Ryu , Éva Tardos

We study content caching with recommendations in a wireless network where the users are connected through a base station equipped with a finite-capacity cache. We assume a fixed set of contents with unknown user preferences and content…

Machine Learning · Computer Science 2025-01-28 Pavamana K J , Chandramani Kishore Singh

We consider the problem of minimizing regret in an $N$ agent heterogeneous stochastic linear bandits framework, where the agents (users) are similar but not all identical. We model user heterogeneity using two popularly used ideas in…

Machine Learning · Statistics 2022-02-04 Avishek Ghosh , Abishek Sankararaman , Kannan Ramchandran

We consider a version of the continuum armed bandit where an action induces a filtered realisation of a non-homogeneous Poisson process. Point data in the filtered sample are then revealed to the decision-maker, whose reward is the total…

Machine Learning · Computer Science 2020-07-21 James A. Grant , Roberto Szechtman