mlsanityData to 7 Oct 2026

Learning with Exposure Constraints in Recommendation Systems

arXiv 2302.01377 ↗First posted 2 Feb 2023cs.LG cs.AIcited by 8

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 30 of its 49 references that are in the map. First posted on arXiv 2 Feb 2023.

Builds on

30 of 49 references.

References · 30

  1. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
  2. 2019Introduction to Multi-Armed Banditscited by 475
  3. 2015Strategic Classificationcited by 256
  4. 2018Fairness of Exposure in Rankingscited by 189
  5. 2019Fairness in Recommendation Ranking through Pairwise Comparisonscited by 127
  6. 2022A Survey on the Fairness of Recommender Systemscited by 102
  7. 2019Achieving Fairness in the Stochastic Multi-armed Bandit Problemcited by 77
  8. 2017Multisided Fairness for Recommendationcited by 69
  9. 2017Rotting Banditscited by 57
  10. 2019Fair Contextual Multi-Armed Bandits: Theory and Experimentscited by 41
  11. 2020Fair Algorithms for Multi-Agent Multi-Armed Banditscited by 41
  12. 2022Modeling Content Creator Incentives on Algorithm-Curated Platformscited by 35
18 more
  1. 2018A Game-Theoretic Approach to Recommendation Systems with Strategic Content Providerscited by 33
  2. 2020Optimizing Long-term Social Welfare in Recommender Systems: A Constrained Matching Approachcited by 32
  3. 2019Recovering Banditscited by 28
  4. 2020The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexitycited by 26
  5. 2021Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationalitycited by 20
  6. 2020Rebounding Bandits for Modeling Satiation Effectscited by 19
  7. 2023A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedbackcited by 19
  8. 2022Competition, Alignment, and Equilibria in Digital Marketplacescited by 17
  9. 2017Multi-armed Bandit Problems with Strategic Armscited by 16
  10. 2019The Intrinsic Robustness of Stochastic Bandits to Strategic Manipulationcited by 15
  11. 2022Modeling Attrition in Recommender Systems with Departing Banditscited by 11
  12. 2021Towards Content Provider Aware Recommender Systems: A Simulation Study on the Interplay between User and Provider Utilitiescited by 9
  13. 2021Towards Fair Recommendation in Two-Sided Platformscited by 8
  14. 2013Linear Regression from Strategic Data Sourcescited by 6
  15. 2022Efficient Algorithms for Planning with Participation Constraintscited by 6
  16. 2019Trust and Trustworthiness in Social Recommender Systemscited by 5
  17. 2022Exploration, Exploitation, and Engagement in Multi-Armed Bandits with Abandonmentcited by 5
  18. 2019Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatiguecited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 3; 2025: 2; 2026: 1.

8 papers.