Bandits with Replenishable Knapsacks: the Best of both Worlds

Counterspeculation, auctions, and competitive sealed tenders

William Vickrey · 1961

Earlier work this paper cites.

Efficient mechanisms for bilateral trading

Roger B Myerson and Mark A Satterthwaite · 1983

Earlier work this paper cites.

Tracking the best expert

Mark Herbster and Manfred K Warmuth · 1998

Earlier work this paper cites.

Tracking a small set of experts by mixing past posteriors

Olivier Bousquet and Manfred K Warmuth · 2002

Earlier work this paper cites.

Coordinating inventory control and pricing strategies with random demand and fixed ordering cost: The finite horizon case

Xin Chen and David Simchi-Levi · 2004

Earlier work this paper cites.

Adaptive algorithms for online decision problems

Elad Hazan and Comandur Seshadhri · 2007

Earlier work this paper cites.

Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms

Omar Besbes and Assaf Zeevi · 2009

Earlier work this paper cites.

Dynamic pricing with limited supply

Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, and Aleksandrs Slivkins · 2012

Earlier work this paper cites.

Learning on a budget: posted price mechanisms for online procurement

Ashwinkumar Badanidiyuru, Robert Kleinberg, and Yaron Singer · 2012

Earlier work this paper cites.

Mirror descent meets fixed share (and feels no regret)

Nicolò Cesa-Bianchi, Pierre Gaillard, Gábor Lugosi, and Gilles Stoltz · 2012

Earlier work this paper cites.

Bandits with knapsacks

Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins · 2013

Cited alongside, same era.

Resourceful contextual bandits

Ashwinkumar Badanidiyuru, John Langford, and Aleksandrs Slivkins · 2014

Cited alongside, same era.

Close the gaps: A learning-while-doing algorithm for single-product revenue management problems

Zizhuo Wang, Shiming Deng, and Yinyu Ye · 2014

Cited alongside, same era.

Bandits with budgets: Regret lower bounds and optimal algorithms

Richard Combes, Chong Jiang, and Rayadurgam Srikant · 2015

Cited alongside, same era.

Explore no more: Improved high-probability regret bounds for non-stochastic bandits

Gergely Neu · 2015

Cited alongside, same era.

An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives

Shipra Agrawal, Nikhil R Devanur, and Lihong Li · 2016

The symmetry between arms and knapsacks: A primal-dual approach for bandits with knapsacks

Xiaocheng Li, Chunlin Sun, and Yinyu Ye · 2021

Later among the works it cites.

The best of many worlds: Dual mirror descent for online allocation problems

Santiago R Balseiro, Haihao Lu, and Vahab Mirrokni · 2022

Later among the works it cites.

Dynamic pricing and inventory control with fixed ordering cost and incomplete demand information

Boxiao Chen, David Simchi-Levi, Yining Wang, and Yuan Zhou · 2022

Later among the works it cites.

Adversarial bandits with knapsacks

Nicole Immorlica, Karthik Sankararaman, Robert Schapire, and Aleksandrs Slivkins · 2022

Later among the works it cites.

Non-monotonic resource utilization in the bandits with knapsacks problem

Raunak Kumar and Robert Kleinberg · 2022

Later among the works it cites.

Online learning under budget and ROI constraints and applications to bidding in non-truthful auctions