Bandits with Single-Peaked Preferences and Limited Resources

Omer Ben-Porat, Gur Keinan, Rotem Torkan

We study an online stochastic matching problem in which an algorithm sequentially matches $U$ users to $K$ arms, aiming to maximize cumulative reward over $T$ rounds under budget c…