Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00338607" target="_blank" >RIV/68407700:21230/19:00338607 - isvavai.cz</a>
Result on the web
<a href="http://www.ifaamas.org/Proceedings/aamas2019/pdfs/p224.pdf" target="_blank" >http://www.ifaamas.org/Proceedings/aamas2019/pdfs/p224.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games
Original language description
Online game playing algorithms produce high-quality strategieswith a fraction of memory and computation required by their of-fline alternatives. Continual Resolving (CR) is a recent theoreti-cally sound approach to online game playing that has been usedto outperform human professionals in poker. However, parts ofthe algorithm were specific to poker, which enjoys many proper-ties not shared by other imperfect information games. We presenta domain-independent formulation of CR applicable to any two-player zero-sum extensive-form games (EFGs). It works with anabstract resolving algorithm, which can be instantiated by variousEFG solvers. We further describe and implement its Monte Carlovariant (MCCR) which uses Monte Carlo Counterfactual RegretMinimization (MCCFR) as a resolver. We prove the correctness ofCR and show anO(T-1/2)-dependence of MCCR’s exploitabilityon the computation time. Furthermore, we present an empiricalcomparison of MCCR with incremental tree building to OnlineOutcome Sampling and Information-set MCTS on several domains.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GJ18-27483Y" target="_blank" >GJ18-27483Y: Online Solution Methods for Imperfect-Information Games</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems
ISBN
978-1-4503-6309-9
ISSN
2523-5699
e-ISSN
—
Number of pages
9
Pages from-to
224-232
Publisher name
ACM
Place of publication
New York
Event location
Montreal
Event date
May 13, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000474345000030