Algorithms for adversarial bandit problems with multiple plays

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6331 LNAI, Issue , 2010, Pages 375-389

  Uchiya, Taishi ^a   Nakamura, Atsuyoshi ^a   Kudo, Mineichi ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

adversarial bandit problem; Multi armed bandit problem; online learning

Indexed keywords

BANDIT PROBLEMS; LINEAR OPTIMIZATION; MULTI-ARMED BANDIT PROBLEM; NUMBER OF ITERATIONS; ONLINE LEARNING; TIME AND SPACE; TIME STEP; UPPER BOUND;

ALGORITHMS; E-LEARNING;

PROBLEM SOLVING;

EID: 78249288447     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16108-7_30     Document Type: Conference Paper

References (16)

1. Abernethy, J., Hazan, E., Rakhlin, A.: Competing in the dark: An efficient algorithm for bandit linear optimization. In: Proceedings of the 21st Annual Conference on Learning Theory, COLT 2008 (2008)
2. Agrawal, R., Hegde, M.V., Teneketzis, D.: Multi-armed bandits with multiple plays and switching cost. Stochastic and Stochastic Reports 29, 437-459 (1990)
3. Anantharam, V., Varaiya, P., Walrand, J.: Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays -part i: I.i.d. rewards. IEEE Transactions on Automatic Control 32, 968-976 (1986) (Pubitemid 18521625)
4. Auer, P., Cesa-bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM Journal on Computing 32, 48-77 (2002)
5. Cesa-bianchi, N., Lugosi, G.: Combinatorial bandits. In: Proceedings of the 22nd Annual Conference on Learning Theory, COLT 2009 (2009)
6. Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. Journal of the ACM 53(3), 320-360 (2006) (Pubitemid 44180741)
7. György, A., Linder, T., Lugosi, G., Ottucsák, G.: The on-line shortest path problem under partial monitoring. Journal of Machine Learning Research 8, 2369-2403 (2007)
8. Kleinberg, R.: Notes from week 8: Multi-armed bandit problems. CS 683-Learning, Games, and Electronic Markets (2007), http://www.cs.cornell.edu/ courses/cs683/2007sp/lecnotes/week8.pdf
9. Krein, M., Milman, D.: On extreme points of regular convex sets. Studia Mathematica, 133-138 (1940)
10. Mahajan, A., Teneketzis, D.: Multi-armed bandit problems. In: Foundations and Applications of Sensor Management, pp. 121-151. Springer, Heidelberg (2007)
11. Nakamura, A., Abe, N.: Improvements to the linear programming based scheduling of web advertisements. Electronic Commerce Research 5, 75-98 (2005) (Pubitemid 41529724)
12. Niculescu-Mizil, A.: Multi-armed bandits with betting. In: COLT 2009 Workshop, pp. 133-138 (2009)
13. Pandelis, D.G., Tenekezis, D.: On the optimality of the gittins index rule in multiarmed bandits with multiple plays. Mathematical Methods of Operations Research 50, 449-461 (1999)
14. Song, N.O., Teneketzis, D.: Discrete search with multiple sensors. Mathematical Methods of Operations Research 60, 1-14 (2004)
15. Uchiya, T., Nakamura, A., Kudo, M.: Adversarial bandit problems with multiple plays. In: The IEICE Technical Report, COMP2009-27 (2009)
16. Warmuth, M.K., Takimoto, E.: Path kernels and multiplicative updates. Journal of Machine Learning Research, 773-818 (2003)