Learning with Exposure Constraints in Recommendation Systems
Omer Ben-Porat, Rotem Torkan
Abstract
Recommendation systems are dynamic economic systems that balance the needs of multiple stakeholders. A recent line of work studies incentives from the content providers’ point of view. Content providers, e.g., vloggers and bloggers, contribute fresh content and rely on user engagement to create revenue and finance their operations. In this work, we propose a contextual multi-armed bandit setting to model the dependency of content providers on exposure. In our model, the system receives a user context in every round and has to select one of the arms. Every arm is a content provider who must receive a minimum number of pulls every fixed time period (e.g., a month) to remain viable in later rounds; otherwise, the arm departs and is no longer available. The system aims to maximize the users’ (content consumers) welfare. To that end, it should learn which arms are vital and ensure they remain viable by subsidizing arm pulls if needed. We develop algorithms with sub-linear regret, as well as a lower bound that demonstrates that our algorithms are optimal up to logarithmic factors.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 68c98108-a0c5-4fad-bccd-6f49c25e9625Cited by top-tier papers3
- Clickbait vs. Quality: How Engagement-Based Optimization Shapes the Content Landscape in Online PlatformsNicole Immorlica, Meena Jagadeesan, Brendan LucierWWW 2024 · 26 citations
- FairSync: Ensuring Amortized Group Exposure in Distributed Recommendation RetrievalChen Xu, Jun Xu, Yiming Ding, Xiao Zhang et al.WWW 2024 · 14 citations
- Bandits with Single-Peaked Preferences and Limited ResourcesOmer Ben-Porat, Gur Keinan, Rotem TorkanICLR 2026
Builds on12
- Achieving Fairness in the Stochastic Multi-Armed Bandit ProblemVishakha Patil, Ganesh Ghalme, Vineet Nair, Y. NarahariAAAI 2020 · 131 citations
- Optimizing Long-term Social Welfare in Recommender Systems: A Constrained Matching ApproachMartin Mladenov, Elliot Creager, Omer Ben-Porat, Kevin Swersky et al.ICML 2020 · 70 citations
- Fair Algorithms for Multi-Agent Multi-Armed BanditsSafwan Hossain, Evi Micha, Nisarg ShahNeurIPS 2021 · 69 citations
- Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded RationalityStefanos Leonardos, Georgios Piliouras, Kelly SpendloveNeurIPS 2021 · 43 citations
- The Intrinsic Robustness of Stochastic Bandits to Strategic ManipulationZhe Feng, David C. Parkes, Haifeng XuICML 2020 · 31 citations
Related papers
- Fairness of Exposure in Stochastic BanditsLequn Wang, Yiwei Bai, Wen Sun, Thorsten JoachimsICML 2021 · 60 citations
- Local Clustering in Contextual Multi-Armed BanditsYikun Ban, Jingrui HeWWW 2021 · 51 citations
- Disposable Linear Bandits for Online RecommendationsMelda Korkut, Andrew LiAAAI 2021 · 5 citations
- Bandit Learning with Joint Effect of Incentivized Sampling, Delayed Sampling Feedback, and Self-Reinforcing User PreferencesTianchen Zhou, Jia Liu, Chaosheng Dong, Yi SunICLR 2022 · 1 citation
- Adversarial Attacks on Linear Contextual BanditsEvrard Garcelon, Baptiste Rozière, Laurent Meunier, Jean Tarbouriech et al.NeurIPS 2020 · 60 citations
