Fetching the paper…
Reading the bibliography…
In today's online advertising markets, a crucial requirement for an advertiser is to control her total expenditure within a time horizon under some budget.
Probabilistic computations: Toward a unified measure of complexity
Andrew Chi-Chih Yao · 1977
Earlier work this paper cites.
The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
Pascal Massart · 1990
Earlier work this paper cites.
Optimal dynamic pricing of inventories with stochastic demand over finite horizons
Guillermo Gallego and Garrett Van Ryzin · 1994
Earlier work this paper cites.
A multiproduct dynamic pricing problem and its applications to network yield management
Guillermo Gallego and Garrett Van Ryzin · 1997
Earlier work this paper cites.
An analysis of bid-price controls for network revenue management
Kalyan Talluri and Garrett Van Ryzin · 1998
Earlier work this paper cites.
Dynamics of bid optimization in online advertisement auctions
Christian Borgs, Jennifer Chayes, Nicole Immorlica, Kamal Jain, Omid Etesami, and Mohammad Mahdian · 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.
Budget smoothing for internet ad auctions: a game theoretic approach
Denis Charles, Deeparnab Chakrabarty, Max Chickering, Nikhil R Devanur, and Lei Wang · 2013
Earlier work this paper cites.
Optimizing budget constrained spend in search advertising
Chinmay Karande, Aranyak Mehta, and Ramakrishnan Srikant · 2013
Earlier work this paper cites.
Real time bid optimization with smooth budget delivery in online advertising
Kuang-Chih Lee, Ali Jalali, and Ali Dasdan · 2013
Earlier work this paper cites.
Online matching and ad allocation
Aranyak Mehta et al · 2013
Earlier work this paper cites.
Budget pacing for targeted online advertisements at linkedin
Deepak Agarwal, Souvik Ghosh, Kai Wei, and Siyu You · 2014
Earlier work this paper cites.
Resourceful contextual bandits
Ashwinkumar Badanidiyuru, John Langford, and Aleksandrs Slivkins · 2014
Cited alongside, same era.
Repeated auctions with budgets in ad exchanges: Approximations and design
Santiago R Balseiro, Omar Besbes, and Gabriel Y Weintraub · 2015
Cited alongside, same era.
Algorithms with logarithmic or sublinear regret for constrained contextual bandits
Huasen Wu, Rayadurgam Srikant, Xin Liu, and Chong Jiang · 2015
Cited alongside, same era.
Smart pacing for effective online ad campaign optimization
Jian Xu, Kuang-chih Lee, Wentong Li, Hang Qi, and Quan Lu · 2015
Cited alongside, same era.
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
The bayesian prophet: A low-regret framework for online decision making
Alberto Vera and Siddhartha Banerjee · 2021
Later among the works it cites.
On the re-solving heuristic for (binary) contextual bandits with knapsacks
Rui Ai, Zhaohua Chen, Xiaotie Deng, Yuqi Pan, Chang Wang, and Mingwei Yang · 2022
Closest in time.
Online learning with knapsacks: the best of both worlds
Matteo Castiglioni, Andrea Celli, and Christian Kroer · 2022
Closest in time.
The parity ray regularizer for pacing in auction markets
Andrea Celli, Riccardo Colini-Baldeschi, Christian Kroer, and Eric Sodomka · 2022
Closest in time.
Budget-constrained auctions with unassured priors
Zhaohua Chen, Xiaotie Deng, Jicheng Li, Chang Wang, and Mingwei Yang · 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.
Introduction to online convex optimization
Elad Hazan · 2016
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
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.
Budget-management strategies in repeated auctions
Santiago Balseiro, Anthony Kim, Mohammad Mahdian, and Vahab Mirrokni · 2021
Cited alongside, same era.
Throttling equilibria in auction markets
Xi Chen, Christian Kroer, and Rachitesh Kumar · 2021
Cited alongside, same era.
Your guide to facebook bid strategy
Facebook · 2022
Closest in time.
Auction throttling and causal inference of online advertising effects
George Gui, Harikesh Nair, and Fengshi Niu · 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.
Budget pacing in repeated auctions: Regret and efficiency without convergence
Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, and Aleksandrs Slivkins · 2023
Closest in time.
Optimal contextual bandits with knapsacks under realizability via regression oracles
Yuxuan Han, Jialin Zeng, Yang Wang, Yang Xiang, and Jiheng Zhang · 2023
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.