On Abruptly-Changing and Slowly-Varying Multiarmed Bandit Problems

W. Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American Statistical Association , vol. 58, no. 301, pp. 13–30, 1963

Original

1963

Earlier work this paper cites.

J. R. Krebs, A. Kacelnik, and P. Taylor, “Test of optimal sampling by foraging great tits,” Nature , vol. 275, no. 5675, pp. 27–31, 1978

1978

Earlier work this paper cites.

T. L. Lai and H. Robbins, “Asymptotically efficient adaptive allocation rules,” Advances in Applied Mathematics , vol. 6, no. 1, pp. 4–22, 1985

1985

Earlier work this paper cites.

R. Agrawal, M. V. Hedge, and D. Teneketzis, “Asymptotically efficient adaptive allocation rules for the multi-armed bandit problem with switching cost,” IEEE Transactions on Automatic Control , vol. 33, no. 10, pp. 899–906, 1988

1988

Earlier work this paper cites.

P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire, “The nonstochastic multiarmed bandit problem,” SIAM Journal on Computing , vol. 32, no. 1, pp. 48–77, 2002

2002

Earlier work this paper cites.

P. Auer, N. Cesa-Bianchi, and P. Fischer, “Finite-time analysis of the multiarmed bandit problem,” Machine Learning , vol. 47, no. 2, pp. 235–256, 2002

2002

Earlier work this paper cites.

A. Garivier and E. Moulines, “On upper-confidence bound policies for non-stationary bandit problems,” arXiv preprint arXiv:0805.3415 , 2008

Original

2008

Earlier work this paper cites.

A. Anandkumar, N. Michael, A. K. Tang, and A. Swami, “Distributed algorithms for learning and cognitive medium access with logarithmic regret,” IEEE Journal on Selected Areas in Communications , vol. 29, no. 4, pp. 731–745, 2011

2011

Earlier work this paper cites.

N. Gupta, O.-C. Granmo, and A. Agrawala, “Thompson sampling for dynamic multi-armed bandits,” in International Conference on Machine Learning and Applications and Workshops , Honolulu, HI, Dec. 2011, pp. 484–489

2011

Cited alongside, same era.

S. Bubeck and N. Cesa-Bianchi, “Regret analysis of stochastic and nonstochastic multi-armed bandit problems,” Machine Learning , vol. 5, no. 1, pp. 1–122, 2012

2012

Cited alongside, same era.

V. Srivastava, P. Reverdy, and N. E. Leonard, “On optimal foraging and multi-armed bandits,” in Proceedings of the 51st Annual Allerton Conference on Communication, Control, and Computing , Monticello, IL, USA, 2013, pp. 494–499

2013

Cited alongside, same era.

M. Y. Cheung, J. Leighton, and F. S. Hover, “Autonomous mobile acoustic relay positioning as a multi-armed bandit with switching costs,” in IEEE/RSJ International Conference on Intelligent Robots and Systems , Tokyo, Japan, November 2013, pp. 3368–3373

2013

Cited alongside, same era.

O. Besbes, Y. Gur, and A. Zeevi, “Optimal exploration-exploitation in a multi-armed-bandit problem with non-stationary rewards,” arXiv preprint arXiv:1405.3316 , 2014

Original

2014

Later among the works it cites.

P. Reverdy, V. Srivastava, and N. E. Leonard, “Modeling human decision making in generalized Gaussian multiarmed bandits,” Proceedings of the IEEE , vol. 102, no. 4, pp. 544–571, 2014

2014

Later among the works it cites.

G. Burtini, J. Loeppky, and R. Lawrence, “A survey of online experiment design with the stochastic multi-armed bandit,” arXiv preprint arXiv:1510.00757 , 2015

Original

2015

Later among the works it cites.

N. Nayyar, D. Kalathil, and R. Jain, “On regret-optimal learning in decentralized multi-player multi-armed bandits,” IEEE Transactions on Control of Network Systems , vol. PP, no. 99, pp. 1–1, 2016

2016

Later among the works it cites.