Fetching the paper…
Reading the bibliography…
In this paper, we study the non-stationary online second price auction problem.
On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
William R Thompson · 1933
Earlier work this paper cites.
Some aspects of the sequential design of experiments
Herbert Robbins · 1952
Earlier work this paper cites.
Optimal auction design
Roger B. Myerson · 1981
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer · 2002
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire · 2002
Earlier work this paper cites.
On upper-confidence bound policies for switching bandit problems
Aurélien Garivier and Eric Moulines · 2011
Earlier work this paper cites.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck and Nicolò Cesa-Bianchi · 2012
Earlier work this paper cites.
Stochastic multi-armed-bandit problem with non-stationary rewards
Yonatan Gur, Assaf J. Zeevi, and Omar Besbes · 2014
Earlier work this paper cites.
Non-stationary stochastic optimization
Omar Besbes, Yonatan Gur, and Assaf J. Zeevi · 2015
Cited alongside, same era.
Regret minimization for reserve prices in second-price auctions
Nicolo Cesa-Bianchi, Claudio Gentile, and Yishay Mansour · 2015
Cited alongside, same era.
Achieving all with no parameters: Adanormalhedge
Haipeng Luo and Robert E. Schapire · 2015
Cited alongside, same era.
Revenue optimization against strategic buyers
Mehryar Mohri and Andres Muñoz Medina · 2015
Cited alongside, same era.
Multi-armed bandits: Competing with optimal sequences
Zohar S. Karnin and Oren Anava · 2016
Cited alongside, same era.
Minimizing regret with multiple reserves
Tim Roughgarden and Joshua R. Wang · 2016
Cited alongside, same era.
Online learning for changing environments using coin betting
Kwang-Sung Jun, Francesco Orabona, Stephen Wright, and Rebecca Willett · 2017
Later among the works it cites.
A change-detection based framework for piecewise-stationary multi-armed bandit problem
Fang Liu, Joohyun Lee, and Ness B. Shroff · 2018
Later among the works it cites.
Efficient contextual bandits in non-stationary worlds
Haipeng Luo, Chen-Yu Wei, Alekh Agarwal, and John Langford · 2018
Later among the works it cites.
Dynamic regret of strongly adaptive methods
Lijun Zhang, Tianbao Yang, Rong Jin, and Zhi-Hua Zhou · 2018
Later among the works it cites.
Adaptively tracking the best bandit arm with an unknown number of distribution changes
Peter Auer, Pratik Gajane, and Ronald Ortner · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tracking the best expert in non-stationary stochastic environments
Chen-Yu Wei, Yi-Te Hong, and Chi-Jen Lu · 2016
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.
Yifang Chen, Chung-Wei Lee, Haipeng Luo, and Chen-Yu Wei · 2019
Closest in time.
Learning to optimize under non-stationarity
Wang Chi Cheung, David Simchi-Levi, and Ruihao Zhu · 2019
Closest in time.
Stochastic one-sided full-information bandit
Haoyu Zhao and Wei Chen · 2019
Closest in time.