A structured multiarmed bandit problem and the greedy policy

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2008, Pages 4945-4950

  Mersereau, Adam J ^a   Rusmevichientong, Paat ^b   Tsitsiklis, John N ^c  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b Cornell University   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL ENGINEERING;

DISCOUNTED REWARD; INFINITE HORIZONS; LINEAR FUNCTIONS; MULTI-ARMED BANDIT PROBLEM; NUMERICAL RESULTS; OPTIMAL POLICIES; PRIOR DISTRIBUTION; STATISTICAL CORRELATION;

PROBABILITY;

EID: 62949175102     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2008.4738680     Document Type: Conference Paper

References (15)

1. T. L. Lai, "Adaptive treatment allocation and the multi-armed bandit problem," Ann. Stat., vol. 15, no. 3, pp. 1091-1114, 1987.
2. J. Gittins and D. M. Jones, "A dynamic allocation index for the sequential design of experiments," in Progress in Statistics, J. Gani, Ed. Amsterdam: North-Holland, 1974, pp. 241-266.
3. T. L. Lai and H. Robbins, "Asymptotically efficient adaptive allocation rules," Adv. Appl. Math., vol. 6, pp. 4-22, 1985.
4. W. R. Thompson, "On the likelihood that one unknown probability exceeds another in view of the evidence of two samples," Biometrika, vol. 25, pp. 285-294, 1933.
5. H. Robbins, "Some aspects of the sequential design of experiments," Bull. Amer. Math. Soc., vol. 58, pp. 527-535, 1952.
6. D. Berry and B. Fristedt, Bandit Problems: Sequential Allocation of Experiments. London: Chapman and Hall, 1985.
7. D. Feldman, "Contributions to the "two-armed bandit" problem," Ann. Math. Stat., vol. 33, pp. 847-856, 1962.
8. R. Keener, "Further contributions to the "two-armed bandit" problem," Ann. Stat., vol. 13, no. 1, pp. 418-422, 1985.
9. E. L. Pressman and I. N. Sonin, Sequential Control With Incomplete Information. London: Academic Press, 1990.
10. J. Ginebra and M. K. Clayton, "Response surface bandits," J. Roy. Stat. Soc. B, vol. 57, no. 4, pp. 771-784, 1995.
11. S. Pandey, D. Chakrabarti, and D. Agrawal, "Multi-armed bandit problems with dependent arms," in Proceedings of the 24th International Conference on Machine Learning, 2007.
12. A. Tewari and P. L. Bartlett, "Optimistic linear programming gives logarithmic regret for irreducible MDPs," in Advances in Neural Information Processing Systems 20, 2008.
13. R. Durrett, Probability: Theory and Examples. Belmont: Duxbury Press, 1996.
14. M. Brezzi and T. L. Lai, "Incomplete learning from endogenous data in dynamic allocation," Econometrica, vol. 68, no. 6, pp. 1511-1516, 2000.
15. S. A. Lippman, "On dynamic programming with unbounded rewards," Management Sci., vol. 21, no. 11, pp. 1225-1233, 1975.