Regret Bounds for Restless Markov Bandits
Research output: Contribution to journal › Article › Research › peer-review
Standard
Regret Bounds for Restless Markov Bandits. / Ortner, Ronald; Ryabko, Daniil; Auer, Peter et al.
In: Theoretical Computer Science, Vol. 558, 2014, p. 62-76.
In: Theoretical Computer Science, Vol. 558, 2014, p. 62-76.
Research output: Contribution to journal › Article › Research › peer-review
Harvard
Ortner, R, Ryabko, D, Auer, P & Munos, R 2014, 'Regret Bounds for Restless Markov Bandits', Theoretical Computer Science, vol. 558, pp. 62-76. https://doi.org/10.1016/j.tcs.2014.09.026
APA
Ortner, R., Ryabko, D., Auer, P., & Munos, R. (2014). Regret Bounds for Restless Markov Bandits. Theoretical Computer Science, 558, 62-76. https://doi.org/10.1016/j.tcs.2014.09.026
Vancouver
Ortner R, Ryabko D, Auer P, Munos R. Regret Bounds for Restless Markov Bandits. Theoretical Computer Science. 2014;558:62-76. doi: 10.1016/j.tcs.2014.09.026
Author
Bibtex - Download
@article{761d4541acca40e3b69a8070ba729beb,
title = "Regret Bounds for Restless Markov Bandits",
author = "Ronald Ortner and Daniil Ryabko and Peter Auer and Remi Munos",
year = "2014",
doi = "10.1016/j.tcs.2014.09.026",
language = "English",
volume = "558",
pages = "62--76",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - Regret Bounds for Restless Markov Bandits
AU - Ortner, Ronald
AU - Ryabko, Daniil
AU - Auer, Peter
AU - Munos, Remi
PY - 2014
Y1 - 2014
U2 - 10.1016/j.tcs.2014.09.026
DO - 10.1016/j.tcs.2014.09.026
M3 - Article
VL - 558
SP - 62
EP - 76
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
ER -
