Fetching the paper…
Reading the bibliography…
We study the framework of a dynamic decision-making scenario with resource constraints.
Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems
Olvi L Mangasarian and T-H Shiau · 1987
Earlier work this paper cites.
Linear and integer programming: theory and practice
Gerard Sierksma · 2001
Earlier work this paper cites.
Using confidence bounds for exploitation-exploration trade-offs
Peter Auer · 2002
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolo Cesa-Bianchi, Yoav Freund, and Robert E Schapire · 2002
Earlier work this paper cites.
Inequalities for the l1 deviation of the empirical distribution
Tsachy Weissman, Erik Ordentlich, Gadiel Seroussi, Sergio Verdu, and Marcelo J Weinberger · 2003
Earlier work this paper cites.
Continuous time associative bandit problems
András György, Levente Kocsis, Ivett Szabó, and Csaba Szepesvári · 2007
Earlier work this paper cites.
Improved algorithms for linear stochastic bandits
Yasin Abbasi-Yadkori, Dávid Pál, and Csaba Szepesvári · 2011
Earlier work this paper cites.
Efficient optimal learning for contextual bandits
Miroslav Dudik, Daniel Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, and Tong Zhang · 2011
Earlier work this paper cites.
A re-solving heuristic with bounded revenue loss for network revenue management with customer choice
Stefanus Jasin and Sunil Kumar · 2012
Earlier work this paper cites.
Taming the monster: A fast and simple algorithm for contextual bandits
Alekh Agarwal, Daniel Hsu, Satyen Kale, John Langford, Lihong Li, and Robert Schapire · 2014
Earlier work this paper cites.
Resourceful contextual bandits
Ashwinkumar Badanidiyuru, John Langford, and Aleksandrs Slivkins · 2014
Earlier work this paper cites.
Logarithmic regret bounds for bandits with knapsacks
Arthur Flajolet and Patrick Jaillet · 2015
Earlier work this paper cites.
Performance of an lp-based control for revenue management with unknown demand parameters
Stefanus Jasin · 2015
Earlier work this paper cites.
Algorithms with logarithmic or sublinear regret for constrained contextual bandits
Huasen Wu, Rayadurgam Srikant, Xin Liu, and Chong Jiang · 2015
Earlier work this paper cites.
Linear contextual bandits with knapsacks
Shipra Agrawal and Nikhil Devanur · 2016
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
Cited alongside, same era.
Online network revenue management using thompson sampling
Kris Johnson Ferreira, David Simchi-Levi, and He Wang · 2018
Cited alongside, same era.
Practical contextual bandits with regression oracles
Dylan Foster, Alekh Agarwal, Miroslav Dudik, Haipeng Luo, and Robert Schapire · 2018
Cited alongside, same era.
Uniformly bounded regret in the multisecretary problem
Alessandro Arlotto and Itai Gurvich · 2019
Cited alongside, same era.
Learning in repeated auctions with budgets: Regret minimization and equilibrium
Santiago R Balseiro and Yonatan Gur · 2019
The bayesian prophet: A low-regret framework for online decision making
Alberto Vera and Siddhartha Banerjee · 2021
Later among the works it cites.
Online allocation and pricing: Constant regret via bellman inequalities
Alberto Vera, Siddhartha Banerjee, and Itai Gurvich · 2021
Later among the works it cites.
The multisecretary problem with many types
Omar Besbes, Yash Kanoria, and Akshit Kumar · 2022
Closest in time.
Online learning with knapsacks: the best of both worlds
Matteo Castiglioni, Andrea Celli, and Christian Kroer · 2022
Closest in time.
Best of many worlds guarantees for online learning with knapsacks
Andrea Celli, Matteo Castiglioni, and Christian Kroer · 2022
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Density estimation – lecture note for 36-708 statistical methods for machine learning, Carnegie Mellon University, 2019
Larry Wasserman · 2019
Cited alongside, same era.
A re-solving heuristic with uniformly bounded loss for network revenue management
Pornpawee Bumpensanti and He Wang · 2020
Cited alongside, same era.
Beyond ucb: Optimal and efficient contextual bandits with regression oracles
Dylan Foster and Alexander Rakhlin · 2020
Cited alongside, same era.
Structured linear contextual bandits: A sharp and geometric smoothed analysis
Vidyashankar Sivakumar, Steven Wu, and Arindam Banerjee · 2020
Cited alongside, same era.
Survey of dynamic resource constrained reward collection problems: Unified model and analysis
Santiago Balseiro, Omar Besbes, and Dana Pizarro · 2021
Cited alongside, same era.
Online linear programming: Dual convergence, new algorithms, and regret bounds
Xiaocheng Li and Yinyu Ye · 2021
Cited alongside, same era.
Guanting Chen, Xiaocheng Li, and Yinyu Ye · 2022
Closest in time.
Smart “predict, then optimize”
Adam N Elmachtoub and Paul Grigas · 2022
Closest in time.
Optimal contextual bandits with knapsacks under realizibility via regression oracles
Yuxuan Han, Jialin Zeng, Yang Wang, Yang Xiang, and Jiheng Zhang · 2022
Closest in time.
Degeneracy is ok: Logarithmic regret for network revenue management with indiscrete distributions
Jiashuo Jiang, Will Ma, and Jiawei Zhang · 2022
Closest in time.
Online contextual decision-making with a smart predict-then-optimize method
Heyuan Liu and Paul Grigas · 2022
Closest in time.
Smoothed adversarial linear contextual bandits with knapsacks
Vidyashankar Sivakumar, Shiliang Zuo, and Arindam Banerjee · 2022
Closest in time.
Efficient contextual bandits with knapsacks via regression
Aleksandrs Slivkins and Dylan Foster · 2022
Closest in time.
Contextual bandits with packing and covering constraints: A modular lagrangian approach via regression
Aleksandrs Slivkins, Karthik Abinav Sankararaman, and Dylan J Foster · 2023
Closest in time.
Logarithmic regret in multisecretary and online linear programs with continuous valuations
Robert L Bray · 2024
Closest in time.