812 citations · 893 across the 21 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.GT2018★ 5 cited
Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games
Michal Sustr, Vojtech Kovarik, Viliam Lisy
Online game playing algorithms produce high-quality strategies with a fraction of memory and computation required by their offline alternatives. Continual Resolving (CR) is a recen…
cs.GT2018
Analysis of Hannan Consistent Selection for Monte Carlo Tree Search in Simultaneous Move Games
Vojtěch Kovařík, Viliam Lisý
Hannan consistency, or no external regret, is a~key concept for learning in games. An action selection algorithm is Hannan consistent (HC) if its performance is eventually as good…
cs.GT2018★ 1 cited
Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games
Jiri Cermak, Viliam Lisy, Branislav Bosansky
Extensive-form games (EFGs) model finite sequential interactions between players. The amount of memory required to represent these games is the main bottleneck of algorithms for co…