Incentivizing High-Quality Content in Online Recommender Systems

For content recommender systems such as TikTok and YouTube, the platform's decision algorithm shapes the incentives of content producers, including how much effort the content producers invest in the quality of their content. Many platforms employ online learning, which creates intertemporal incentives, since content produced today affects recommendations of future content. In this paper, we study the incentives arising from online learning, analyzing the quality of content produced at a Nash equilibrium. We show that classical online learning algorithms, such as Hedge and EXP3, unfortunately incentivize producers to create low-quality content. In particular, the quality of content is upper bounded in terms of the learning rate and approaches zero for typical learning rate schedules. Motivated by this negative result, we design a different learning algorithm -- based on punishing producers who create low-quality content -- that correctly incentivizes producers to create high-quality content. At a conceptual level, our work illustrates the unintended impact that a platform's learning algorithm can have on content quality and opens the door towards designing platform learning algorithms that incentivize the creation of high-quality content.

[1]  Nir Rosenfeld,et al.  Performative Recommendation: Diversifying Content via Strategic Incentives , 2023, ICML.

[2]  Denis Nekipelov,et al.  How Bad is Top-K Recommendation under Competing Content Creators? , 2023, ICML.

[3]  Omer Ben-Porat,et al.  Learning with Exposure Constraints in Recommendation Systems , 2023, WWW.

[4]  Michael I. Jordan,et al.  The Sample Complexity of Online Contract Design , 2022, EC.

[5]  Nika Haghtalab,et al.  Learning in Stackelberg Games with Non-myopic Agents , 2022, EC.

[6]  J. Steinhardt,et al.  Supply-Side Equilibria in Recommender Systems , 2022, ArXiv.

[7]  Michael I. Jordan,et al.  Modeling Content Creator Incentives on Algorithm-Curated Platforms , 2022, ArXiv.

[8]  Jamie H. Morgenstern,et al.  Preference Dynamics Under Personalized Recommendations , 2022, EC.

[9]  Stuart J. Russell,et al.  Estimating and Penalizing Induced Preference Shifts in Recommender Systems , 2022, ICML.

[10]  Michael I. Jordan,et al.  Who Leads and Who Follows in Strategic Classification? , 2021, NeurIPS.

[11]  Gergely Neu,et al.  Efficient and Robust Algorithms for Adversarial Linear Contextual Bandits , 2020, COLT.

[12]  Yiling Chen,et al.  Learning Strategy-Aware Linear Classifiers , 2019, NeurIPS.

[13]  Moshe Tennenholtz,et al.  A Game-Theoretic Approach to Recommendation Systems with Strategic Content Providers , 2018, NeurIPS.

[14]  Yang Liu,et al.  Incentivizing High Quality User Contributions: New Arm Generation in Bandit Learning , 2018, AAAI.

[15]  Aaron Roth,et al.  Strategic Classification from Revealed Preferences , 2017, EC.

[16]  Elad Hazan,et al.  Introduction to Online Convex Optimization , 2016, Found. Trends Optim..

[17]  Haipeng Luo,et al.  Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits , 2016, NIPS.

[18]  Karthik Sridharan,et al.  BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits , 2016, ICML.

[19]  Christos H. Papadimitriou,et al.  Strategic Classification , 2015, ITCS.

[20]  Maria-Florina Balcan,et al.  Commitment Without Regrets: Online Learning in Stackelberg Security Games , 2015, EC.

[21]  Yishay Mansour,et al.  Implementing the “Wisdom of the Crowd” , 2013, Journal of Political Economy.

[22]  Patrick Hummel,et al.  Learning and incentives in user-generated content: multi-armed bandits with endogenous arms , 2013, ITCS '13.

[23]  Csaba Szepesvári,et al.  Improved Algorithms for Linear Stochastic Bandits , 2011, NIPS.

[24]  R. Preston McAfee,et al.  Incentivizing high-quality user-generated content , 2011, WWW.

[25]  Philip M. Long,et al.  Associative Reinforcement Learning using Linear Probabilistic Concepts , 1999, ICML.

[26]  Moshe Tennenholtz,et al.  Content Provider Dynamics and Coordination in Recommendation Ecosystems , 2020, NeurIPS.

[27]  Ran Ben Basat A Game Theoretic Analysis of the Adversarial Retrieval Setting , 2017 .

[28]  Johannes Gerd Becker,et al.  On the existence of symmetric mixed strategy equilibria , 2006 .