Incentivizing High-Quality Content in Online Recommender Systems
Not on the map. Why?
Abstract (arXiv)
In content recommender systems such as TikTok and YouTube, the platform's recommendation algorithm shapes content producer incentives. Many platforms employ online learning, which generates intertemporal incentives, since content produced today affects recommendations of future content. We study the game between producers and analyze the content created at equilibrium. We show that standard online learning algorithms, such as Hedge and EXP3, unfortunately incentivize producers to create low-quality content, where producers' effort approaches zero in the long run for typical learning rate schedules. Motivated by this negative result, we design learning algorithms that incentivize producers to invest high effort and achieve high user welfare. At a conceptual level, our work illustrates the unintended impact that a platform's learning algorithm can have on content quality and introduces algorithmic approaches to mitigating these effects.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 20 of its 42 references that are in the map. First posted on arXiv 13 Jun 2023.
Builds on
20 of 42 references.
References · 20
- 2019Introduction to Online Convex Optimizationcited by 803
- 2015Strategic Classificationcited by 257
- 2017Strategic Classification from Revealed Preferencescited by 128
- 2021Who Leads and Who Follows in Strategic Classification?cited by 53
- 2020Efficient and Robust Algorithms for Adversarial Linear Contextual Banditscited by 43
- 2022Modeling Content Creator Incentives on Algorithm-Curated Platformscited by 35
- 2022The Sample Complexity of Online Contract Designcited by 35
- 2018A Game-Theoretic Approach to Recommendation Systems with Strategic Content Providerscited by 33
- 2022Supply-Side Equilibria in Recommender Systemscited by 33
- 2020Optimizing Long-term Social Welfare in Recommender Systems: A Constrained Matching Approachcited by 32
- 2022Estimating and Penalizing Induced Preference Shifts in Recommender Systemscited by 29
- 2022Learning in Stackelberg Games with Non-myopic Agentscited by 29
8 more
- 2023How Bad is Top-K Recommendation under Competing Content Creators?cited by 27
- 2022Preference Dynamics Under Personalized Recommendationscited by 25
- 2016BISTRO: An Efficient Relaxation-Based Method for Contextual Banditscited by 20
- 2016Improved Regret Bounds for Oracle-Based Adversarial Contextual Banditscited by 13
- 2023Performative Recommendation: Diversifying Content via Strategic Incentivescited by 12
- 2022Efficient Stackelberg Strategies for Finitely Repeated Gamescited by 9
- 2023Learning with Exposure Constraints in Recommendation Systemscited by 8
- 2023Recommending to Strategic Userscited by 8
Built on by
Citing papers per year: 2023: 1; 2024: 4; 2025: 0; 2026: 1.
6 papers.
- 2024Clickbait vs. Quality: How Engagement-Based Optimization Shapes the Content Landscape in Online Platformscited by 13
- 2024Accounting for AI and Users Shaping One Another: The Role of Mathematical Modelscited by 11
- 2023Bandits Meet Mechanism Design to Combat Clickbait in Online Recommendationcited by 6
- 2024Strategic Linear Contextual Banditscited by 5
- 2024How to Strategize Human Content Creation in the Era of GenAI?cited by 4
- 2026Prediction-Intervention Games and Invariant Setscited by 0
- 2026Prediction-Intervention Games and Invariant Sets16 May 2026
- 2024How to Strategize Human Content Creation in the Era of GenAI?7 Jun 2024
- 2024Strategic Linear Contextual Bandits1 Jun 2024
- 2024Accounting for AI and Users Shaping One Another: The Role of Mathematical Models18 Apr 2024
- 2024Clickbait vs. Quality: How Engagement-Based Optimization Shapes the Content Landscape in Online Platforms18 Jan 2024
- 2023Bandits Meet Mechanism Design to Combat Clickbait in Online Recommendation27 Nov 2023