Fetching the paper…
Reading the bibliography…
Advertisers increasingly use automated bidding to optimize their ad campaigns on online advertising platforms.
“On tail probabilities for martingales”
David Freedman · 1975
Earlier work this paper cites.
“A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting”
Yoav Freund and Robert. Schapire · 1997
Earlier work this paper cites.
“Weak convergence and empirical processes with applications to statistics”
AW Vaart and Jon Wellner · 1997
Earlier work this paper cites.
“The Nonstochastic Multiarmed Bandit Problem”
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund and Robert. Schapire · 2002
Earlier work this paper cites.
“The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions”
Robert. Kleinberg and Frank Leighton · 2003
Earlier work this paper cites.
“Online Convex Programming and Generalized Infinitesimal Gradient Ascent”
Martin Zinkevich · 2003
Earlier work this paper cites.
“Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions”
Yanjun Han et al · 2007
Earlier work this paper cites.
“Adaptive Algorithms for Online Decision Problems”
Elad Hazan and C. Seshadhri · 2007
Earlier work this paper cites.
“Noisy binary search and its applications”
Richard. Karp and Robert Kleinberg · 2007
Earlier work this paper cites.
“Bandits with Knapsacks”
Ashwinkumar Badanidiyuru, Robert Kleinberg and Aleksandrs Slivkins · 2013
Earlier work this paper cites.
“Bandits with concave rewards and convex knapsacks”
Shipra Agrawal and Nikhil. Devanur · 2014
Earlier work this paper cites.
“Explore no more: Improved high-probability regret bounds for non-stochastic bandits”
Gergely Neu · 2015
Cited alongside, same era.
“Linear Contextual Bandits with Knapsacks”
Shipra Agrawal and Nikhil. Devanur · 2016
Cited alongside, same era.
“Introduction to Online Convex Optimization”
Elad Hazan · 2016
Cited alongside, same era.
“Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium”
Santiago. Balseiro and Yonatan Gur · 2017
Cited alongside, same era.
“Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning”
Nicolò Cesa-Bianchi, Pierre Gaillard, Claudio Gentile and Sébastien Gerchinovitz · 2017
Cited alongside, same era.
“Contextual Bandits with Cross-Learning”
Santiago. Balseiro et al · 2019
Cited alongside, same era.
“Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem”
Raunak Kumar and Robert Kleinberg · 2022
Later among the works it cites.
“Bandits with Replenishable Knapsacks: the Best of both Worlds”
Martino Bernasconi, Matteo Castiglioni, Andrea Celli and Federico Fusco · 2023
Later among the works it cites.
“Online Bidding in Repeated Non-Truthful Auctions under Budget and ROI Constraints”
Matteo Castiglioni, Andrea Celli and Christian Kroer · 2023
Later among the works it cites.
“Online Bidding Algorithms for Return-on-Spend Constrained Advertisers”
Zhe Feng, Swati Padmanabhan and Di Wang · 2023
Later among the works it cites.
“Approximately Stationary Bandits with Knapsacks”
Giannis Fikioris and Éva Tardos · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Adversarial Bandits with Knapsacks”
Nicole Immorlica, Karthik Sankararaman, Robert. Schapire and Aleksandrs Slivkins · 2019
Cited alongside, same era.
“Dual Mirror Descent for Online Allocation Problems”
Santiago. Balseiro, Haihao Lu and Vahab. Mirrokni · 2020
Cited alongside, same era.
“Online Learning with Vector Costs and Bandits with Knapsacks”
Thomas Kesselheim and Sahil Singla · 2020
Cited alongside, same era.
“Book announcement: Introduction to Multi-Armed Bandits”
Aleksandrs Slivkins · 2020
Cited alongside, same era.
“Online Learning with Knapsacks: the Best of Both Worlds”
Matteo Castiglioni, Andrea Celli and Christian Kroer · 2022
Cited alongside, same era.
“Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions”
Giannis Fikioris and Éva Tardos · 2023
Later among the works it cites.
“Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence”
Jason Gaitonde et al · 2023
Later among the works it cites.
“Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics”
Brendan Lucier, Sarath Pattathil, Aleksandrs Slivkins and Mengxiao Zhang · 2023
Later among the works it cites.
“Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression”
Aleksandrs Slivkins, Karthik Sankararaman and Dylan. Foster · 2023
Later among the works it cites.
“Learning to Bid in Repeated First-Price Auctions with Budgets”
Qian Wang, Zongjun Yang, Xiaotie Deng and Yuqing Kong · 2023
Later among the works it cites.