| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Upper Confidence Trees with Short Term Partial Information
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.
Cited literature [13 references]
https://hal.inria.fr/inria-00585475
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
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
File
samcts.pdf
Files produced by the author(s)