mlsanityData to 7 Oct 2026

Incentive-Aware Recommender Systems in Two-Sided Markets

arXiv 2211.15381 ↗First posted 23 Nov 2022cs.IR cs.LG stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

Online platforms in the Internet Economy commonly incorporate recommender systems that recommend products (or "arms") to users (or "agents"). A key challenge in this domain arises from myopic agents who are naturally incentivized to exploit by choosing the optimal arm based on current information, rather than exploring various alternatives to gather information that benefits the collective. We propose a novel recommender system that aligns with agents' incentives while achieving asymptotically optimal performance, as measured by regret in repeated interactions. Our framework models this incentive-aware system as a multi-agent bandit problem in two-sided markets, where the interactions of agents and arms are facilitated by recommender systems on online platforms. This model incorporates incentive constraints induced by agents' opportunity costs. In scenarios where opportunity costs are known to the platform, we show the existence of an incentive-compatible recommendation algorithm. This algorithm pools recommendations between a genuinely good arm and an unknown arm using a randomized and adaptive strategy. Moreover, when these opportunity costs are unknown, we introduce an algorithm that randomly pools recommendations across all arms, utilizing the cumulative loss from each arm as feedback for strategic exploration. We demonstrate that both algorithms satisfy an ex-post fairness criterion, which protects agents from over-exploitation. All code for using the proposed algorithms and reproducing results is made available on GitHub.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 13 of its 53 references that are in the map. First posted on arXiv 23 Nov 2022.

Builds on

13 of 53 references.

References · 13

  1. 2019Introduction to Multi-Armed Banditscited by 475
  2. 2017Mostly Exploration-Free Algorithms for Contextual Banditscited by 85
  3. 2015Bayesian Incentive-Compatible Bandit Explorationcited by 53
  4. 2016Bayesian Exploration: Incentivizing Exploration in Bayesian Gamescited by 37
  5. 2020The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexitycited by 26
  6. 2018Incentivizing Exploration with Selective Data Disclosurecited by 24
  7. 2020Greedy Algorithm almost Dominates in Smoothed Contextual Banditscited by 20
  8. 2017Human Interaction with Recommendation Systemscited by 15
  9. 2020Learning Strategies in Decentralized Matching Markets under Uncertain Preferencescited by 14
  10. 2021Learning in Multi-Stage Decentralized Matching Marketscited by 12
  11. 2017Fairness Incentives for Myopic Agentscited by 10
  12. 2015Economic Recommendation Systemscited by 8
1 more
  1. 2022Uplifting Banditscited by 2

Built on by

Cited by year

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

5 papers.