98 citations · 333 across the 23 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.AI2018★ 21 cited
Deep Counterfactual Regret Minimization
Noam Brown, Adam Lerer, Sam Gross +1
Counterfactual Regret Minimization (CFR) is the leading framework for solving large imperfect-information games. It converges to an equilibrium by iteratively traversing the game t…
cs.GT2018
Solving Imperfect-Information Games via Discounted Regret Minimization
Noam Brown, Tuomas Sandholm
Counterfactual regret minimization (CFR) is a family of iterative algorithms that are the most popular and, in practice, fastest approach to approximately solving large imperfect-i…
cs.GT2018★ 33 cited
Depth-Limited Solving for Imperfect-Information Games
Noam Brown, Tuomas Sandholm, Brandon Amos
A fundamental challenge in imperfect-information games is that states do not have well-defined values. As a result, depth-limited search algorithms used in single-agent settings an…