Skip to Main content Skip to Navigation
Conference papers

Upper Confidence Trees with Short Term Partial Information

Olivier Teytaud 1, 2 Sébastien Flory 3 
2 TAO - Machine Learning and Optimisation
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : We show some mathematical links between partially observable (PO) games in which information is regu larly revealed, and simultaneous actions games. Using this, we study the extension of Monte-Carlo Tr ee Search algorithms to PO games and to games with simultaneous actions. We apply the results to Urb an Rivals, a free PO internet card game with more than 10 millions of registered users.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Olivier Teytaud Connect in order to contact the contributor
Submitted on : Tuesday, February 26, 2013 - 12:39:45 PM
Last modification on : Sunday, June 26, 2022 - 11:58:21 AM
Long-term archiving on: : Monday, May 27, 2013 - 6:40:11 AM


Files produced by the author(s)



Olivier Teytaud, Sébastien Flory. Upper Confidence Trees with Short Term Partial Information. EvoGames 2011, Apr 2011, Turino, Italy. pp.153-162, ⟨10.1007/978-3-642-20525-5⟩. ⟨inria-00585475v2⟩



Record views


Files downloads