Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire. The Nonstochastic Multiarmed Bandit Problem. SIAM Journal on Computing, 32(1):48-77, 2002. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Nonstochastic Multiarmed Bandits with Unrestricted DelaysTobias Sommer Thune, Nicolò Cesa-Bianchi, Yevgeny Seldin. nips 2019: 6538-6547 [doi] Finite-Time Regret Bounds for the Multiarmed Bandit ProblemNicolò Cesa-Bianchi, Paul Fischer. icml 1998: 100-108 Finite-time Analysis of the Multiarmed Bandit ProblemPeter Auer, Nicolò Cesa-Bianchi, Paul Fischer. ml, 47(2-3):235-256, 2002.
The following publications are possibly variants of this publication: