812 citations · 867 across the 3 of their papers we have counts for
3 papers
cs.AI2017★ 812 cited
DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker
Matej Moravčík, Martin Schmid, Neil Burch +7
Artificial intelligence has seen several breakthroughs in recent years, with games often serving as milestones. A common feature of these games is that players have perfect informa…
cs.AI2017★ 9 cited
AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games
Neil Burch, Martin Schmid, Matej Moravčík +1
Evaluating agent performance when outcomes are stochastic and agents use randomized strategies can be challenging when there is limited data available. The variance of sampled outc…
cs.GT2012★ 46 cited
No-Regret Learning in Extensive-Form Games with Imperfect Recall
Marc Lanctot, Richard Gibson, Neil Burch +2
Counterfactual Regret Minimization (CFR) is an efficient no-regret learning algorithm for decision problems modeled as extensive games. CFR's regret bounds depend on the requiremen…