Bandit based Monte-Carlo planning

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

Volumn 4212 LNAI, Issue , 2006, Pages 282-293

  Kocsis, Levente ^a   Szepesvári, Csaba ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; ERROR ANALYSIS; LEARNING ALGORITHMS; LEARNING SYSTEMS; MONTE CARLO METHODS;

FINITE SAMPLE BOUNDS; MONTE-CARLO PLANNING; OPTIMAL SOLUTIONS;

MARKOV PROCESSES;

EID: 33750293964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11871842_29     Document Type: Conference Paper

References (14)

1. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3):235-256, 2002.
2. P. Auer, N. Cesa-Bianchi, Y. Freund, and R.E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32:48-77, 2002.
3. A.G. Barto, S.J. Bradtke, and S.P. Singh. Real-time learning and control using asynchronous dynamic programming. Technical report 91-57, Computer Science Department, University of Massachusetts, 1991.
4. D. Billings, A. Davidson, J. Schaeffer, and D. Szafron. The challenge of poker. Artificial Intelligence, 134:201-240, 2002.
5. B. Bouzy and B. Helmstetter. Monte Carlo Go developments. In H.J. van den Herik, H. Iida, and E.A. Heinz, editors, Advances in Computer Games 10, pages 159-174, 2004.
6. H.S. Chang, M. Fu, J. Hu, and S.I. Marcus. An adaptive sampling algorithm for solving Markov decision processes. Operations Research, 53(1):126-139, 2005.
7. M. Chung, M. Buro, and J. Schaeffer. Monte Carlo planning in RTS games. In CIG 2005, Colchester, UK, 2005.
8. M. Kearns, Y. Mansour, and A.Y. Ng. A sparse sampling algorithm for nearoptimal planning in large Markovian decisi on processes. In Proceedings of IJCAI'99, pages 1324-1331, 1999.
9. T.L. Lai and H. Robbins. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6:4-22, 1985.
10. L. Péret and F. Garcia. On-line search for solving Markov decision processes via heuristic sampling. In R.L. de Mántaras and L. Saitta, editors, ECAI, pages 530-534, 2004.
11. B. Sheppard. World-championship-caliber Scrabble. Artificial Intelligence, 134(1-2):241-275, 2002.
12. S.J.J. Smith and D.S. Nau. An analysis of forward pruning. In AAAI, pages 1386-1391, 1994.
13. G. Tesauro and G.R. Galperin. On-line policy improvement using Monte-Carlo search. In M.C. Mozer, M.I. Jordan, and T. Petsche, editors, NIPS 9, pages 1068-1074, 1997.
14. R. Vanderbei. Optimal sailing strategies, statistics and operations research program. University of Princeton, http://www.sor.princeton.edu/r~vdb/ sail/sail.html., 1996.