Interactive Learning with Pricing for Optimal and Stable Allocations in Markets
Not on the map. Why?
Abstract (arXiv)
Large-scale online recommendation systems must facilitate the allocation of a limited number of items among competing users while learning their preferences from user feedback. As a principled way of incorporating market constraints and user incentives in the design, we consider our objectives to be two-fold: maximal social welfare with minimal instability. To maximize social welfare, our proposed framework enhances the quality of recommendations by exploring allocations that optimistically maximize the rewards. To minimize instability, a measure of users' incentives to deviate from recommended allocations, the algorithm prices the items based on a scheme derived from the Walrasian equilibria. Though it is known that these equilibria yield stable prices for markets with known user preferences, our approach accounts for the inherent uncertainty in the preferences and further ensures that the users accept their recommendations under offered prices. To the best of our knowledge, our approach is the first to integrate techniques from combinatorial bandits, optimal resource allocation, and collaborative filtering to obtain an algorithm that achieves sub-linear social welfare regret as well as sub-linear instability. Empirical studies on synthetic and real-world data also demonstrate the efficacy of our strategy compared to approaches that do not fully incorporate all these aspects.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 38 references that are in the map. First posted on arXiv 13 Dec 2022.
Builds on
13 of 38 references.
References · 13
- 2014Matrix Completion and Low-Rank SVD via Fast Alternating Least Squarescited by 104
- 2015Linear Contextual Bandits with Knapsackscited by 82
- 2017Rotting Banditscited by 57
- 2019Competing Bandits in Matching Marketscited by 56
- 2020Low-Rank Generalized Linear Bandit Problemscited by 49
- 2017Minimal Exploration in Structured Stochastic Banditscited by 41
- 2021Learning Equilibria in Matching Markets from Bandit Feedbackcited by 34
- 2015Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Banditscited by 29
- 2016Matching while Learningcited by 19
- 2017Online Interactive Collaborative Filtering Using Multi-Armed Bandit with Dependent Armscited by 13
- 2020Competing Bandits: The Perils of Exploration Under Competitioncited by 12
- 2016Structured Stochastic Linear Banditscited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.