Fetching the paper…
Reading the bibliography…
We consider Bandits with Knapsacks (henceforth, BwK), a general model for multi-armed bandits under supply/budget constraints.
Introduction to Online Convex Optimization
Elad Hazan · 1909
Earlier work this paper cites.
Approximation algorithms for combinatorial problems
David S Johnson · 1974
Earlier work this paper cites.
On the ratio of optimal integral and fractional covers
László Lovász · 1975
Earlier work this paper cites.
Competitive paging algorithms
Amos Fiat, Richard M Karp, Michael Luby, Lyle A McGeoch, Daniel D Sleator, and Neal E Young · 1991
Earlier work this paper cites.
The weighted majority algorithm
Nick Littlestone and Manfred K. Warmuth · 1994
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire · 1995
Earlier work this paper cites.
Game theory, on-line prediction and boosting
Yoav Freund and Robert E Schapire · 1996
Earlier work this paper cites.
Buy-at-bulk network design
Baruch Awerbuch and Yossi Azar · 1997
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E. Schapire · 1997
Earlier work this paper cites.
The finite capacity dial-a-ride problem
Moses Charikar and Balaji Raghavachari · 1998
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Yoav Freund and Robert E Schapire · 1999
Earlier work this paper cites.
Lectures on modern convex optimization: analysis, algorithms, and engineering applications , volume 2
Ahron Ben-Tal and Arkadi Nemirovski · 2001
Earlier work this paper cites.
The online set cover problem
Noga Alon, Baruch Awerbuch, and Yossi Azar · 2003
Earlier work this paper cites.
Convex optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Nearly tight bounds for the continuum-armed bandit problem
Robert Kleinberg · 2004
Earlier work this paper cites.
Online Convex Optimization in the Bandit Setting: Gradient Descent without a Gradient
Abraham Flaxman, Adam Kalai, and H. Brendan McMahan · 2005
Earlier work this paper cites.
Bandit Problems
Dirk Bergemann and Juuso Välimäki · 2006
Earlier work this paper cites.
Prediction, learning, and games
Nicolò Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Multi-armed Bandits with Metric Switching Costs
Sudipta Guha and Kamesh Munagala · 2007
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.
The on-line shortest path problem under partial monitoring
András György, Tamás Linder, Gábor Lugosi, and György Ottucsák · 2007
Earlier work this paper cites.
The Epoch-Greedy Algorithm for Contextual Multi-armed Bandits
John Langford and Tong Zhang · 2007
Earlier work this paper cites.
Adwords and generalized online matching
Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani · 2007
Earlier work this paper cites.
Expander flows, geometric embeddings and graph partitioning
Sanjeev Arora, Satish Rao, and Umesh Vazirani · 2009
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.
The AdWords problem: Online keyword matching with budgeted bidders under random permutations
Nikhil R. Devanur and Thomas P. Hayes · 2009
Earlier work this paper cites.
Online stochastic packing applied to display ad allocation
Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, and Clifford Stein · 2010
Earlier work this paper cites.
Non-stochastic bandit slate problems
Satyen Kale, Lev Reyzin, and Robert E. Schapire · 2010
Earlier work this paper cites.
ϵ \epsilon -first policies for budget-limited multi-armed bandits
Long Tran-Thanh, Archie Chapman, Enrique Munoz de Cote, Alex Rogers, and Nicholas R. Jennings · 2010
Earlier work this paper cites.
Minimax policies for combinatorial prediction games
Jean-Yves Audibert, Sébastien Bubeck, and Gábor Lugosi · 2011
Earlier work this paper cites.
A polylogarithmic-competitive algorithm for the k-server problem
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, and Joseph Naor · 2011
Earlier work this paper cites.
Contextual bandit algorithms with supervised learning guarantees
Alina Beygelzimer, John Langford, Lihong Li, Lev Reyzin, and Robert E. Schapire · 2011
Earlier work this paper cites.
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng · 2011
Earlier work this paper cites.
Near-optimal no-regret algorithms for zero-sum games
Constantinos Daskalakis, Alan Deckelbaum, and Anthony Kim · 2011
Cited alongside, same era.
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A. Wilkens · 2011
Cited alongside, same era.
Efficient optimal leanring for contextual bandits
Miroslav Dudík, Daniel Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, and Tong Zhang · 2011
Cited alongside, same era.
Multi-Armed Bandit Allocation Indices
John Gittins, Kevin Glazebrook, and Richard Weber · 2011
Cited alongside, same era.
Approximation algorithms for correlated knapsacks and non-martingale bandits
Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, and R. Ravi · 2011
Cited alongside, same era.
Bandits with budgets: Regret lower bounds and optimal algorithms
Richard Combes, Chong Jiang, and Rayadurgam Srikant · 2015
Later among the works it cites.
Inducing approximately optimal flow using truthful mediators
Ryan Rogers, Aaron Roth, Jonathan Ullman, and Zhiwei Steven Wu · 2015
Later among the works it cites.
Online network design algorithms via hierarchical decompositions
Seeun Umboh · 2015
Later among the works it cites.
Linear contextual bandits with knapsacks
Shipra Agrawal and Nikhil R. Devanur · 2016
Later among the works it cites.
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives
Shipra Agrawal, Nikhil R. Devanur, and Lihong Li · 2016
Later among the works it cites.
An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits
Peter Auer and Chao-Kai Chiang · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
David P Williamson and David B Shmoys · 2011
Cited alongside, same era.
Contextual bandit learning with predictable rewards
Alekh Agarwal, Miroslav Dudík, Satyen Kale, John Langford, and Robert E. Schapire · 2012
Cited alongside, same era.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Cited alongside, same era.
Dynamic pricing with limited supply
Moshe Babaioff, Shaddin Dughmi, Robert D. Kleinberg, and Aleksandrs Slivkins · 2012
Cited alongside, same era.
Learning on a budget: posted price mechanisms for online procurement
Ashwinkumar Badanidiyuru, Robert Kleinberg, and Yaron Singer · 2012
Cited alongside, same era.
Blind network revenue management
Omar Besbes and Assaf J. Zeevi · 2012
Cited alongside, same era.
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Sébastien Bubeck and Nicolo Cesa-Bianchi · 2012
Cited alongside, same era.
Later among the works it cites.
Online algorithms for covering and packing problems with convex objectives
Yossi Azar, Niv Buchbinder, TH Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, and Joseph Naor · 2016
Later among the works it cites.
Jointly private convex programming
Justin Hsu, Zhiyi Huang, Aaron Roth, and Zhiwei Steven Wu · 2016
Later among the works it cites.
Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits
Gergely Neu and Gábor Bartók · 2016
Later among the works it cites.
BISTRO: an efficient relaxation-based method for contextual bandits
Alexander Rakhlin and Karthik Sridharan · 2016
Later among the works it cites.
Watch and learn: Optimizing from revealed preferences feedback
Aaron Roth, Jonathan Ullman, and Zhiwei Steven Wu · 2016
Later among the works it cites.
On frank-wolfe and equilibrium computation
Jacob D Abernethy and Jun-Kun Wang · 2017
Later among the works it cites.
A reductions approach to fair classification
Alekh Agarwal, Alina Beygelzimer, Miroslav Dudík, John Langford, and Hanna Wallach · 2017
Later among the works it cites.
Kernel-based methods for bandit convex optimization
Sébastien Bubeck, Yin Tat Lee, and Ronen Eldan · 2017
Later among the works it cites.
An online convex optimization approach to proactive network resource allocation
Tianyi Chen, Qing Ling, and Georgios B Giannakis · 2017
Later among the works it cites.
Online convex optimization with time-varying constraints
Michael J Neely and Hao Yu · 2017
Later among the works it cites.
Multidimensional dynamic pricing for welfare maximization
Aaron Roth, Aleksandrs Slivkins, Jonathan Ullman, and Zhiwei Steven Wu · 2017
Later among the works it cites.
An improved parametrization and analysis of the EXP3++ algorithm for stochastic and adversarial bandits
Yevgeny Seldin and Gábor Lugosi · 2017
Later among the works it cites.
Online saddle point problem with applications to constrained online convex optimization
Adrian Rivera Cardoso, He Wang, and Huan Xu · 2018
Closest in time.
Bandit convex optimization for scalable and dynamic iot management
Tianyi Chen and Georgios B Giannakis · 2018
Closest in time.
Preventing fairness gerrymandering: Auditing and learning for subgroup fairness
Michael Kearns, Seth Neel, Aaron Roth, and Zhiwei Steven Wu · 2018
Closest in time.
Bandit Algorithms
Tor Lattimore and Csaba Szepesvári · 2018
Closest in time.
Stochastic bandits robust to adversarial corruptions
Thodoris Lykouris, Vahab Mirrokni, and Renato Paes-Leme · 2018
Closest in time.
Combinatorial semi-bandits with knapsacks
Karthik Abinav Sankararaman and Aleksandrs Slivkins · 2018
Closest in time.
Acceleration through optimistic no-regret dynamics
Jun-Kun Wang and Jacob D. Abernethy · 2018
Closest in time.
More adaptive algorithms for adversarial bandits
Chen-Yu Wei and Haipeng Luo · 2018
Closest in time.
Competing against nash equilibria in adversarially changing zero-sum games
Adrian Rivera Cardoso, Jacob D. Abernethy, He Wang, and Huan Xu · 2019
Closest in time.
Unifying the stochastic and the adversarial bandits with knapsack
Anshuka Rangi, Massimo Franceschetti, and Long Tran-Thanh · 2019
Closest in time.
Introduction to multi-armed bandits
Aleksandrs Slivkins · 2019
Closest in time.
Online learning with vector costs and bandits with knapsacks
Thomas Kesselheim and Sahil Singla · 2020
Closest in time.
Online learning with knapsacks: the best of both worlds
Matteo Castiglioni, Andrea Celli, and Christian Kroer · 2022
Closest in time.
Budget pacing in repeated auctions: Regret and efficiency without convergence, 2022
Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, and Aleksandrs Slivkins · 2022
Closest in time.