Timezone: »

Regret-Based Pruning in Extensive-Form Games
Noam Brown · Tuomas Sandholm

Wed Dec 09 04:00 PM -- 08:59 PM (PST) @ 210 C #68

Counterfactual Regret Minimization (CFR) is a leading algorithm for finding a Nash equilibrium in large zero-sum imperfect-information games. CFR is an iterative algorithm that repeatedly traverses the game tree, updating regrets at each information set.We introduce an improvement to CFR that prunes any path of play in the tree, and its descendants, that has negative regret. It revisits that sequence at the earliest subsequent CFR iteration where the regret could have become positive, had that path been explored on every iteration. The new algorithm maintains CFR's convergence guarantees while making iterations significantly faster---even if previously known pruning techniques are used in the comparison. This improvement carries over to CFR+, a recent variant of CFR. Experiments show an order of magnitude speed improvement, and the relative speed improvement increases with the size of the game.

Author Information

Noam Brown (Carnegie Mellon University)
Tuomas Sandholm (Carnegie Mellon University)

More from the Same Authors