Anytime algorithms for multi-armed bandit problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 928-936

  Kleinberg, Robert ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33244473533     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109659     Document Type: Conference Paper

References (15)

1. P. AUER, N. CESA-BIANCHI, Y. FREUND, AND R. E. SCHAPIRE, The nonstochastic multiarmed bandit problem, SIAM J. Computing, 32 (2002), pp. 48-77.
2. B. AWERBUCH AND R. KLEINBERG, Adaptive routing with end-to-end feedback: distributed learning and geometric approaches, in Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), 2004, pp. 45-53.
3. _, Competitive collaborative learning, in Proceedings of the 18th Annual Conference on Learning Theory (COLT), 2005. To appear.
4. A. BLUM AND J. HARTLINE, Near-optimal online auctions, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 2005, pp. 1156-1163.
5. A. BLUM, V. KUMAR, A. RUDRA, AND F. WU, Online learning in online auctions, Theoretical Computer Science, 324 (2004), pp. 137-146.
6. M. BODDY, Anytime problem solving using dynamic programming, Proceedings of National Conference on Artificial Intelligence (AAAI), (1991).
7. E. COPE, Regret and convergence bounds for immediate-reward reinforcement learning with continuous action spaces, 2004. Unpublished manuscript.
8. A. D. FLAXMAN, A. T. KALAI, AND H. B. MCMAHAN, Online convex optimization in the bandit setting: Gradient descent without a gradient, in Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005, pp. 385-394.
9. Y. FREUND AND R. E. SCHAPIRE, A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and System Sciences, 55 (1997), pp. 119-139.
10. J. C. GITTINS AND D. M. JONES, A dynamic allocation index for the sequential design of experiments, in Progress in Statistics, J. G. et al., ed., North-Holland, 1974, pp. 241-266.
11. R. KLEINBERG, Nearly tight bounds for the continuum-armed bandit problem, in Advances in Neural Information Processing Systems 17, L. K. Saul, Y. Weiss, and L. Bottou, eds., MIT Press, Cambridge, MA, 2005, pp. 697-704.
12. R. KLEINBERG AND T. LEIGHTON, The value of knowing a demand curve: Bounds on regret for on-line posted-price auctions, in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOGS), 2003, pp. 594-605.
13. N. LITTLESTONE AND M. K. WARMUTH, The weighted majority algorithm, Information and Computation, 108 (1994), pp. 212-260.
14. H. B. MCMAHAN AND A. BLUM, Online geometric optimization in the bandit setting against an adaptive adversary, in Proceedings of the 17th Annual Conference on Learning Theory (COLT), vol. 3120 of Lecture Notes in Computer Science, Springer Verlag, 2004, pp. 109-123.
15. S. ZILBERSTEIN, Operational rationality through compilation of anytime algorithms, 1993.