ML Anthology

Finite-Time Analysis of the Multiarmed Bandit Problem

Peter Auer, Nicolò Cesa-Bianchi, Paul Fischer
MLJ 2002 pp. 235-256
doi:10.1023/A:1013689704352 /mlj/2002/auer2002mlj-finitetime/
MLJ Semantic Scholar

Cite

Text

Auer et al. "Finite-Time Analysis of the Multiarmed Bandit Problem." Machine Learning, 2002. doi:10.1023/A:1013689704352

Markdown

[Auer et al. "Finite-Time Analysis of the Multiarmed Bandit Problem." Machine Learning, 2002.](https://mlanthology.org/mlj/2002/auer2002mlj-finitetime/) doi:10.1023/A:1013689704352

BibTeX

@article{auer2002mlj-finitetime,
  title     = {{Finite-Time Analysis of the Multiarmed Bandit Problem}},
  author    = {Auer, Peter and Cesa-Bianchi, Nicolò and Fischer, Paul},
  journal   = {Machine Learning},
  year      = {2002},
  pages     = {235-256},
  doi       = {10.1023/A:1013689704352},
  volume    = {47},
  url       = {https://mlanthology.org/mlj/2002/auer2002mlj-finitetime/}
}