Fetching the paper…
Reading the bibliography…
Recently the online advertising market has exhibited a gradual shift from second-price auctions to first-price auctions.
Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator
Aryeh Dvoretzky, Jack Kiefer, and Jacob Wolfowitz · 1956
Earlier work this paper cites.
Nonparametric estimation from incomplete observations
Edward L. Kaplan and Paul Meier · 1958
Earlier work this paper cites.
Competitive bidding in high-risk situations
Edward C. Capen, Robert V. Clapp, and William M. Campbell · 1971
Earlier work this paper cites.
The complexity of dynamic programming
Chef-Seng Chow and John N Tsitsiklis · 1989
Earlier work this paper cites.
The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
Pascal Massart · 1990
Earlier work this paper cites.
Rate of convergence in the central limit theorem for empirical processes
R. Norvaiša and V. Paulauskas · 1991
Earlier work this paper cites.
How the us treasury should auction its debt
V. Chari and Robert Weber · 1992
Earlier work this paper cites.
Existence of an equilibrium in first price auctions
Bernard Lebrun · 1996
Earlier work this paper cites.
Sealed-bid auctions: case study
Frans D. J. van Schaik, Jack P. C. Kleijnen, et al · 2001
Earlier work this paper cites.
Optimal no-regret learning in repeated first-price auctions
Yanjun Han, Zhengyuan Zhou, and Tsachy Weissman · 2003
Earlier work this paper cites.
Unbiased estimation of functionals under random censorship
Akio Suzukawa · 2004
Earlier work this paper cites.
Estimating marginal survival function by adjusting for dependent censoring using many covariates
Donglin Zeng · 2004
Earlier work this paper cites.
Learning to bid optimally and efficiently in adversarial first-price auctions
Yanjun Han, Zhengyuan Zhou, Aaron Flores, Erik Ordentlich, and Tsachy Weissman · 2007
Earlier work this paper cites.
Information feedback in first price auctions
Ignacio Esponda · 2008
Cited alongside, same era.
Budget optimization for sponsored search: Censored learning in MDPs
Kareem Amin, Michael Kearns, Peter Key, and Anton Schwaighofer · 2012
Cited alongside, same era.
Repeated auctions under budget constraints: Optimal bidding strategies and equilibria
Ramakrishna Gummadi, Peter Key, and Alexandre Proutiere · 2012
Cited alongside, same era.
Bandits with knapsacks
Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins · 2013
Cited alongside, same era.
Resourceful contextual bandits
Ashwinkumar Badanidiyuru, John Langford, and Aleksandrs Slivkins · 2014
Cited alongside, same era.
Perfect bayesian equilibria in repeated sales
Nikhil R Devanur, Yuval Peres, and Balasubramanian Sivan · 2014
Weakly consistent optimal pricing algorithms in repeated posted-price auctions with strategic buyer
Alexey Drutsa · 2018
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.
Dynamic incentive-aware learning: Robust pricing in contextual auctions
Negin Golrezaei, Adel Javanmard, and Vahab Mirrokni · 2019
Later among the works it cites.
Optimal pricing in repeated posted-price auctions with different patience of the seller and the buyer
Arsenii Vanunts and Alexey Drutsa · 2019
Later among the works it cites.
Regret bounds for discounted MDPs
Shuang Liu and Hao Su · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Efficient regret bounds for online bid optimisation in budget-limited sponsored search auctions
Long Tran-Thanh, Lampros Stavrogiannis, Victor Naroditskiy, Valentin Robu, Nicholas R Jennings, and Peter Key · 2014
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
Cited alongside, same era.
Online learning of optimal bidding strategy in repeated multi-commodity auctions
M. Sevi Baltaoglu, Lang Tong, and Qing Zhao · 2017
Cited alongside, same era.
Horizon-independent optimal pricing in repeated auctions with truthful and strategic buyers
Alexey Drutsa · 2017
Cited alongside, same era.
Real-time bidding with side information
Arthur Flajolet and Patrick Jaillet · 2017
Cited alongside, same era.
Yuan Deng and Hanrui Zhang · 2021
Later among the works it cites.
Nearly minimax optimal reinforcement learning for discounted MDPs
Jiafan He, Dongruo Zhou, and Quanquan Gu · 2021
Later among the works it cites.
Q-learning with logarithmic regret
Kunhe Yang, Lin Yang, and Simon Du · 2021
Later among the works it cites.
Provably efficient reinforcement learning for discounted MDPs with feature mapping
Dongruo Zhou, Jiafan He, and Quanquan Gu · 2021
Later among the works it cites.
Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence
Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, and Aleksandrs Slivkins · 2022
Closest in time.
Faqs about adsense moving to a first-price auction - google adsense help
Google LLC · 2022
Closest in time.
Digital advertising spending worldwide from 2019 to 2024 (in billion u.s. dollars)
Statista · 2022
Closest in time.