Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-Time Analysis of the Multi-Armed Bandit Problem. Machine Learning 47(2-3), 235–256 (2002)
2. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The Nonstochastic Multiarmed Bandit Problem. SIAM Journal on Computing 32(1), 48–77 (2002); (A preliminary version appeared in FOCS 1995 as Gambling in a Rigged Casino: The Adversarial Multi-Armed Bandit Problem)
3. Awerbuch, B., Kleinberg, R.: Online Linear Optimization and Adaptive Routing. J. Comput. Syst. Sci. 74(1), 97–114 (2008)
4. Awerbuch, B., Mansour, Y.: Adapting to a Reliable Network Path. In: PODC, pp. 360–367 (2003)
5. Blum, A., Mansour, Y.: From External to Internal Regret. Journal of Machine Learning Research 8, 1307–1324 (2007)