The Irrevocable Multiarmed Bandit Problem
Published Online:1 Apr 2011https://doi.org/10.1287/opre.1100.0891
Supplemental Material
opre.1100.0891-sm-ec.pdf (165 KB)
- Cited by
- 8 May 2026 | Operations Research, Vol. 0, No. 0
- 2 May 2026 | Applied Intelligence, Vol. 56, No. 7
- 21 April 2026 | Operations Research, Vol. 0, No. 0
- 28 July 2023 | Operations Research, Vol. 73, No. 1
- Pattern Recognition Letters, Vol. 154
- 27 July 2020 | Management Science, Vol. 67, No. 3
- 2 March 2020 | Brain-Computer Interfaces, Vol. 6, No. 4
- 5 February 2018 | Mathematics of Operations Research, Vol. 43, No. 3
- 31 May 2016 | Management Science, Vol. 63, No. 7
- 30 June 2016 | Indian Journal of Pure and Applied Mathematics, Vol. 47, No. 2
- 1 October 2014 | Management Science, Vol. 60, No. 11
- 27 September 2013 | Management Science, Vol. 60, No. 1
- 11 April 2013 | Manufacturing & Service Operations Management, Vol. 15, No. 3
- 24 May 2013 | Operations Research, Vol. 61, No. 3
- SSRN Electronic Journal, Vol. 24
Volume 59, Issue 2
March-April 2011
Pages iii-534
Article Information
Supplemental Material
Metrics
Information
- Received:June 01, 2008
- Accepted:April 01, 2010
- Published Online:April 01, 2011
Copyright © 2011, INFORMS
Cite as
Vivek F. Farias, Ritesh Madan, (2011) The Irrevocable Multiarmed Bandit Problem. Operations Research 59(2):383-399.
https://doi.org/10.1287/opre.1100.0891
Keywords
