The following publications are possibly variants of this publication:
- Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player ActionsRichard G. Gibson, Neil Burch, Marc Lanctot, Duane Szafron. nips 2012: 1889-1897 [doi]
- Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games Using BaselinesMartin Schmid, Neil Burch, Marc Lanctot, Matej Moravcik, Rudolf Kadlec, Michael Bowling. AAAI 2019: 2157-2164 [doi]
- Monte Carlo Sampling for Regret Minimization in Extensive GamesMarc Lanctot, Kevin Waugh, Martin Zinkevich, Michael H. Bowling. nips 2009: 1078-1086 [doi]
- Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimizationMichael Johanson, Nolan Bard, Marc Lanctot, Richard G. Gibson, Michael Bowling. atal 2012: 837-846 [doi]
- Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information GamesMichal Sustr, Vojtech Kovarík, Viliam Lisý. atal 2019: 224-232 [doi]
- Minimizing Simple and Cumulative Regret in Monte-Carlo Tree SearchTom Pepels, Tristan Cazenave, Mark H. M. Winands, Marc Lanctot. ecai 2014: 1-15 [doi]