Fetching the paper…
Reading the bibliography…
We study online learning problems in which a decision maker wants to maximize their expected reward without violating a finite set of $m$ resource constraints.
Marktform und Gleichgewicht
Heinrich von Stackelberg · 1934
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadij Semenovič Nemirovskij and David Borisovich Yudin · 1983
Earlier work this paper cites.
Optimization by vector space methods
David G Luenberger · 1997
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.
Mirror descent and nonlinear projected subgradient methods for convex optimization
Amir Beck and Marc Teboulle · 2003
Earlier work this paper cites.
Infinite dimensional analysis
Charalambos D Aliprantis, Kim C Border, et al · 2006
Earlier work this paper cites.
Prediction, learning, and games
Nicolo Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Online primal-dual algorithms for maximizing ad-auctions revenue
Niv Buchbinder, Kamal Jain, and Joseph Seffi Naor · 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.
Adwords and generalized online matching
Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani · 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.
Online ad assignment with free disposal
Jon Feldman, Nitish Korula, Vahab Mirrokni, Shanmugavelayutham Muthukrishnan, and Martin Pál · 2009
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.
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Nikhil R Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A Wilkens · 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.
Security and game theory: algorithms, deployed systems, lessons learned
Milind Tambe · 2011
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.
Blind network revenue management
Omar Besbes and Assaf Zeevi · 2012
Earlier work this paper cites.
The best of both worlds: Stochastic and adversarial bandits
Sébastien Bubeck and Aleksandrs Slivkins · 2012
Earlier work this paper cites.
Trading regret for efficiency: online convex optimization with long term constraints
Mehrdad Mahdavi, Rong Jin, and Tianbao Yang · 2012
Earlier work this paper cites.
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Vahab S Mirrokni, Shayan Oveis Gharan, and Morteza Zadimoghaddam · 2012
Cited alongside, same era.
Knapsack based optimal policies for budget–limited multi–armed bandits
Long Tran-Thanh, Archie Chapman, Alex Rogers, and Nicholas Jennings · 2012
Cited alongside, same era.
Bandits with knapsacks
Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins · 2013
Cited alongside, same era.
Stochastic convex optimization with multiple objectives
Mehrdad Mahdavi, Tianbao Yang, and Rong Jin · 2013
Cited alongside, same era.
Truthful incentives in crowdsourcing tasks using regret minimization mechanisms
Adish Singla and Andreas Krause · 2013
Cited alongside, same era.
Bandit convex optimization for scalable and dynamic iot management
Tianyi Chen and Georgios B Giannakis · 2018
Later among the works it cites.
Stochastic bandits robust to adversarial corruptions
Thodoris Lykouris, Vahab Mirrokni, and Renato Paes Leme · 2018
Later among the works it cites.
Combinatorial semi-bandits with knapsacks
Karthik Abinav Sankararaman and Aleksandrs Slivkins · 2018
Later among the works it cites.
Bandits with global convex constraints and objective
Shipra Agrawal and Nikhil R Devanur · 2019
Later among the works it cites.
Learning in repeated auctions with budgets: Regret minimization and equilibrium
Santiago R Balseiro and Yonatan Gur · 2019
Later among the works it cites.
Robust dynamic assortment optimization in the presence of outlier customers
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Aleksandrs Slivkins · 2013
Cited alongside, same era.
Bandits with concave rewards and convex knapsacks
Shipra Agrawal and Nikhil R Devanur · 2014
Cited alongside, same era.
Resourceful contextual bandits
Ashwinkumar Badanidiyuru, John Langford, and Aleksandrs Slivkins · 2014
Cited alongside, same era.
One practical algorithm for both stochastic and adversarial bandits
Yevgeny Seldin 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.
Dynamic pricing with limited supply
Moshe Babaioff, Shaddin Dughmi, Robert Kleinberg, and Aleksandrs Slivkins · 2015
Cited alongside, same era.
Commitment without regrets: Online learning in stackelberg security games
Maria-Florina Balcan, Avrim Blum, Nika Haghtalab, and Ariel D Procaccia · 2015
Cited alongside, same era.
Xi Chen, Akshay Krishnamurthy, and Yining Wang · 2019
Later among the works it cites.
Adversarial bandits with knapsacks
Nicole Immorlica, Karthik Abinav Sankararaman, Robert Schapire, and Aleksandrs Slivkins · 2019
Later among the works it cites.
Unifying the stochastic and the adversarial bandits with knapsack
Anshuka Rangi, Massimo Franceschetti, and Long Tran-Thanh · 2019
Later among the works it cites.
Introduction to multi-armed bandits
Aleksandrs Slivkins et al · 2019
Later among the works it cites.
Dual mirror descent for online allocation problems
Santiago Balseiro, Haihao Lu, and Vahab Mirrokni · 2020
Later among the works it cites.
Learning to bid optimally and efficiently in adversarial first-price auctions
Yanjun Han, Zhengyuan Zhou, Aaron Flores, Erik Ordentlich, and Tsachy Weissman · 2020
Later among the works it cites.
Online learning with vector costs and bandits with knapsacks
Thomas Kesselheim and Sahil Singla · 2020
Later among the works it cites.
Learning to bid in contextual first price auctions
Ashwinkumar Badanidiyuru, Zhe Feng, and Guru Guruganesh · 2021
Later among the works it cites.
Budget-management strategies in repeated auctions
Santiago Balseiro, Anthony Kim, Mohammad Mahdian, and Vahab Mirrokni · 2021
Later among the works it cites.
Multiplicative pacing equilibria in auction markets
Vincent Conitzer, Christian Kroer, Eric Sodomka, and Nicolas E Stier-Moses · 2021
Later among the works it cites.
Better regularization for sequential decision spaces: Fast convergence rates for Nash, correlated, and team equilibria
Gabriele Farina, Christian Kroer, and Tuomas Sandholm · 2021
Later among the works it cites.
Bandits with knapsacks beyond the worst case
Karthik Abinav Sankararaman and Aleksandrs Slivkins · 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
Closest in time.
Online learning with knapsacks: the best of both worlds
Matteo Castiglioni, Andrea Celli, and Christian Kroer · 2022
Closest in time.
Approximately stationary bandits with knapsacks
Giannis Fikioris and Éva Tardos · 2023
Closest in time.