most citedReduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.GT2016★ 2 cited

Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning

Noam Brown, Tuomas Sandholm

Counterfactual Regret Minimization (CFR) is the most popular iterative algorithm for solving zero-sum imperfect-information games. Regret-Based Pruning (RBP) is an improvement that…