Finite Time Analysis of the Multiarmed Bandit Problem
Research output: Contribution to journal › Article › Research › peer-review
Standard
Finite Time Analysis of the Multiarmed Bandit Problem. / Auer, Peter; Cesa-Bianchi, N.; Fischer, P.
In: Machine learning, Vol. 47, 2002, p. 235-256.
In: Machine learning, Vol. 47, 2002, p. 235-256.
Research output: Contribution to journal › Article › Research › peer-review
Harvard
Auer, P, Cesa-Bianchi, N & Fischer, P 2002, 'Finite Time Analysis of the Multiarmed Bandit Problem', Machine learning, vol. 47, pp. 235-256.
APA
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002). Finite Time Analysis of the Multiarmed Bandit Problem. Machine learning, 47, 235-256.
Vancouver
Auer P, Cesa-Bianchi N, Fischer P. Finite Time Analysis of the Multiarmed Bandit Problem. Machine learning. 2002;47:235-256.
Author
Bibtex - Download
@article{cee9f04fef2c4ae39c2b53bbe6610a61,
title = "Finite Time Analysis of the Multiarmed Bandit Problem",
author = "Peter Auer and N. Cesa-Bianchi and P. Fischer",
year = "2002",
language = "English",
volume = "47",
pages = "235--256",
journal = "Machine learning",
issn = "0885-6125",
publisher = "Springer Netherlands",
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - Finite Time Analysis of the Multiarmed Bandit Problem
AU - Auer, Peter
AU - Cesa-Bianchi, N.
AU - Fischer, P.
PY - 2002
Y1 - 2002
M3 - Article
VL - 47
SP - 235
EP - 256
JO - Machine learning
JF - Machine learning
SN - 0885-6125
ER -
