Upper confidence trees with short term partial information

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

Volumn 6624 LNCS, Issue PART 1, 2011, Pages 153-162

  Teytaud, Olivier ^a   Flory, Sébastien ^b  

^a INRIA SACLAY   (France)

^b Boostr   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CARD GAMES; MONTE-CARLO TREE SEARCHES; PARTIAL INFORMATION; SHORT TERM; UPPER CONFIDENCE TREES;

ARTIFICIAL INTELLIGENCE;

EID: 79955805743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20525-5_16     Document Type: Conference Paper

References (14)

1. Audibert, J.-Y., Bubeck, S.: Minimax policies for adversarial and stochastic bandits. In: Proceedings of the Annual Conference on Learning Theory (COLT) (2009)
2. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: Gambling in a rigged casino: the adversarial multi-armed bandit problem. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 322-331. IEEE Computer Society Press, Los Alamitos (1995)
3. Bouzy, B., Métivier, M.: Multi-agent learning experiments on repeated matrix games. In: ICML, pp. 119-126 (2010)
4. Coulom, R.: Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In: Ciancarini, P., van den Herik, H.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72-83. Springer, Heidelberg (2007)
5. Grigoriadis, M.D., Khachiyan, L.G.: A sublinear-time randomized approximation algorithm for matrix games. Operations Research Letters 18(2), 53-58 (1995)
6. Hearn, R.A., Demaine, E.: Games, Puzzles, and Computation. AK Peters, Wellesley (2009)
7. Kocsis, L., Szepesvári, C.: Bandit based monte-carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282-293. Springer, Heidelberg (2006)
8. Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics 6, 4-22 (1985)
9. Lee, C.-S., Wang, M.-H., Chaslot, G., Hoock, J.-B., Rimmel, A., Teytaud, O., Tsai, S.-R., Hsu, S.-C., Hong, T.-P.: The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. IEEE Transactions on Computational Intelligence and AI in games (2009)
10. Madani, O., Hanks, S., Condon, A.: On the undecidability of probabilistic planning and related stochastic optimization problems. Artif. Intell. 147(1-2), 5-34 (2003)
11. Mundhenk, M., Goldsmith, J., Lusena, C., Allender, E.: Complexity of finite-horizon markov decision process problems. J. ACM 47(4), 681-720 (2000)
12. Papadimitriou, C.H., Tsitsiklis, J.N.: The complexity of markov decision processses. Mathematics of Operations Research 12(3), 441-450 (1987)
13. Rintanen, J.: Complexity of Planning with Partial Observability. In: Proceedings of ICAPS 2003 Workshop on Planning under Uncertainty and Incomplete Information, Trento, Italy (June 2003)
14. Teytaud, O.: Decidability and complexity in partially observable antagonist coevolution. In: Proceedings of Dagstuhl's seminar 10361 (2010)