Multiple tree for partially observable Monte-Carlo tree search

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 53-62

  Auger, David ^a  

^a INRIA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER GAMES; TREES (MATHEMATICS); EVOLUTIONARY ALGORITHMS; MONTE CARLO METHODS;

MONTE-CARLO TREE SEARCHES; MULTIPLE TREES; NASH EQUILIBRIA;

MONTE CARLO METHODS; TREES (MATHEMATICS);

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

References (13)

1. Audibert, J.Y., Bubeck, S.: Minimax policies for adversarial and stochastic bandits. In: Proceedings of the 22nd Annual Conference on Learning Theory. Omnipress (2009)
2. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multi-armed bandit problem. SIAM Journal on Computing 32(1), 48-77 (2003)
3. Borsboom, J., Saito, J., Chaslot, G., Uiterwijk, J.: A comparison of Monte-Carlo methods for Phantom Go. In: Proc. 19th Belgian-Dutch Conference on Artificial Intelligence-BNAIC, Utrecht, The Netherlands (2007)
4. Brown, G.W.: Iterative solution of games by fictitious play. Activity Analysis of Production and Allocation 13(1), 374-376 (1951)
5. Cazenave, T.: A Phantom-Go program. In: van den Herik, H.J., Hsu, S.-C., Hsu, T.-s., Donkers, H.H.L.M(J.) (eds.) CG 2005. LNCS, vol. 4250, pp. 120-125. Springer, Heidelberg (2006)
6. Cesa-Bianchi, N., Lugosi, G.: Prediction, learning, and games. Cambridge Univ Pr, Cambridge (2006)
7. Ciancarini, P., Favini, G.P.: Monte carlo tree search techniques in the game of Kriegspiel. In: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 474-479 (2009)
8. Coulom, R.: Efficient selectivity and backup operators in monte-carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 72-83. Springer, Heidelberg (2007)
9. Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)
10. 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)
11. Li, D.H.: Kriegspiel: Chess Under Uncertainty. Premier Pub. Co. (1994)
12. Parker, A., Nau, D., Subrahmanian, V.S.: Game-tree search with combinatorially large belief states. In: International Joint Conference on Artificial Intelligence, vol. 19, p. 254 (2005)
13. Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. Advances in Neural Information Processing Systems 20, 1729-1736 (2008)