Search Results for author:
Found 1 papers, 0 papers with code
Online Allocation and Pricing: Constant Regret via Bellman Inequalities
We develop a framework for designing simple and efficient policies for a family of online allocation and pricing problems, that includes online packing, budget-constrained probing, dynamic pricing, and online contextual bandits with knapsacks.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
