Linear Programming for Finite State Multi-Armed Bandit Problems
Published Online:1 Feb 1986https://doi.org/10.1287/moor.11.1.180
- Cited by
- 13 June 2023 | Mathematical Methods of Operations Research, Vol. 63
- Journal of the ACM, Vol. 69, No. 3
- 15 December 2020 | Mathematics, Vol. 8, No. 12
- Synthesis Lectures on Communication Networks, Vol. 12, No. 1
- IEEE Transactions on Cognitive Communications and Networking, Vol. 5, No. 2
- Statistical Science, Vol. 30, No. 2
- Knowledge-Based Systems, Vol. 58
- 4 January 2012 | Annals of Operations Research, Vol. 208, No. 1
- 24 May 2013 | Operations Research, Vol. 61, No. 3
- 16 February 2011
- 1 November 2007 | INFORMS Journal on Computing, Vol. 19, No. 4
- 1 July 2016 | Advances in Applied Probability, Vol. 33, No. 1
- ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research, Vol. 40, No. 2
- Computers & Mathematics with Applications, Vol. 26, No. 12
- ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, Vol. 34, No. 6
- 27 July 2009 | Probability in the Engineering and Informational Sciences, Vol. 2, No. 3
Volume 11, Issue 1
February 1986
Pages 1-191
Article Information
Metrics
Information
- Published Online:February 01, 1986
© 1986 INFORMS
Cite as
Yih Ren Chen, Michael N. Katehakis, (1986) Linear Programming for Finite State Multi-Armed Bandit Problems. Mathematics of Operations Research 11(1):180-183.
https://doi.org/10.1287/moor.11.1.180
Keywords
