Lower Bounds on the Sample Complexity of Exploration in the Multi-Armed Bandit Problem

Mannor and Tsitsiklis. "Lower Bounds on the Sample Complexity of Exploration in the Multi-Armed Bandit Problem." Annual Conference on Computational Learning Theory, 2003. doi:10.1007/978-3-540-45167-9_31

[Mannor and Tsitsiklis. "Lower Bounds on the Sample Complexity of Exploration in the Multi-Armed Bandit Problem." Annual Conference on Computational Learning Theory, 2003.](https://mlanthology.org/colt/2003/mannor2003colt-lower/) doi:10.1007/978-3-540-45167-9_31

@inproceedings{mannor2003colt-lower,
  title     = {{Lower Bounds on the Sample Complexity of Exploration in the Multi-Armed Bandit Problem}},
  author    = {Mannor, Shie and Tsitsiklis, John N.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2003},
  pages     = {418-432},
  doi       = {10.1007/978-3-540-45167-9_31},
  url       = {https://mlanthology.org/colt/2003/mannor2003colt-lower/}
}