Mitigating Filter Bubbles Under a Competitive Diffusion Model
Prithu Banerjee, Wei Chen, Laks V. S. Lakshmanan
Abstract
While social networks greatly facilitate information dissemination, they are well known to have contributed to the phenomena of filter bubbles and echo chambers. This in turn can lead to societal polarization and erosion of trust in public institutions. Mitigating filter bubbles is an urgent open problem. Recently, approaches based on the influence maximization paradigm have been proposed in our community for mitigating filter bubbles by balancing exposure to opposing viewpoints. However, existing works ignore the inherent competition between the adoption of opposing viewpoints by users. In this paper, we propose a realistic model for the filter bubble problem, which unlike previous work, captures the competition between opposing opinions propagating in a network as well as the complementary nature of the reward for exposing users to both those opinions. We formulate an optimization problem for mitigating filter bubbles under our model. We establish several evidences of the intrinsic difficulty in developing constant approximation to the problem and develop a heuristic and two instance-dependent approximation algorithms. Our experiments over 4 real datasets show that our heuristic far outperforms two state-of-the-art baselines as well as other algorithms in both efficiency and mitigating filter bubbles. We also empirically demonstrate that our best heuristic performs close to the optimal objective, which is obtained by utilizing the theoretical bounds of our approximation algorithms.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed NetworksJingbang Chen, Qiuyang Mang, Hangrui Zhou, Richard Peng et al.KDD 2024 · 3 citations
- Fast Computation and Optimization for Opinion-Based Quantities of Friedkin-Johnsen ModelHaoxin Sun, Yubo Sun, Xiaotian Zhou, Zhongzhi ZhangNeurIPS 2025 · 2 citations
Builds on5
- Minimizing Polarization and Disagreement in Social Networks via Link RecommendationLiwang Zhu, Qi Bao, Zhongzhi ZhangNeurIPS 2021 · 68 citations
- Balancing Spreads of Influence in a Social NetworkRuben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo GilbertAAAI 2020 · 22 citations
- Co-exposure Maximization in Online Social NetworksSijing Tu, Çigdem Aslay, Aristides GionisNeurIPS 2020 · 19 citations
- Influence Maximization Based on Dynamic Personal Perception in Knowledge GraphYa-Wen Teng, Yishuo Shi, Chih-Hua Tai, De-Nian Yang et al.ICDE 2021 · 11 citations
- Maximizing Social Welfare in a Competitive Diffusion ModelPrithu Banerjee, Laks V. S. Lakshmanan, Wei ChenVLDB 2021 · 9 citations
Related papers
- Online Platforms and the Fair Exposure Problem under HomophilyJakob Schoeffer, Alexander Ritchie, Keziah Naggita, Faidra Monachou et al.AAAI 2023 · 5 citations
- Optimal Engagement-Diversity Tradeoffs in Social MediaFabian Baumann, Daniel Halpern, Ariel D. Procaccia, Iyad Rahwan et al.WWW 2024 · 6 citations
- Optimizing Social Network Interventions via Hypergradient-Based Recommender System DesignMarino Kühne, Panagiotis D. Grontas, Giulia De Pasquale, Giuseppe Belgioioso et al.ICML 2025
- Quantifying the Potential to Escape Filter Bubbles: A Behavior-Aware Measure via Contrastive SimulationDifu Feng, Qianqian Xu, Zitai Wang, Cong Hua et al.AAAI 2026 · 1 citation
- Modeling the Impact of Timeline Algorithms on Opinion Dynamics Using Low-rank UpdatesTianyi Zhou, Stefan Neumann, Kiran Garimella, Aristides GionisWWW 2024 · 7 citations
