ML Anthology

On Upper-Confidence Bound Policies for Switching Bandit Problems

Aurélien Garivier, Eric Moulines
ALT 2011 pp. 174-188
doi:10.1007/978-3-642-24412-4_16 /alt/2011/garivier2011alt-upperconfidence/
PDF ALT Semantic Scholar

Cite

Text

Garivier and Moulines. "On Upper-Confidence Bound Policies for Switching Bandit Problems." International Conference on Algorithmic Learning Theory, 2011. doi:10.1007/978-3-642-24412-4_16

Markdown

[Garivier and Moulines. "On Upper-Confidence Bound Policies for Switching Bandit Problems." International Conference on Algorithmic Learning Theory, 2011.](https://mlanthology.org/alt/2011/garivier2011alt-upperconfidence/) doi:10.1007/978-3-642-24412-4_16

BibTeX

@inproceedings{garivier2011alt-upperconfidence,
  title     = {{On Upper-Confidence Bound Policies for Switching Bandit Problems}},
  author    = {Garivier, Aurélien and Moulines, Eric},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2011},
  pages     = {174-188},
  doi       = {10.1007/978-3-642-24412-4_16},
  url       = {https://mlanthology.org/alt/2011/garivier2011alt-upperconfidence/}
}