Then we solve it with counterfactual regret (CFR) minimization algorithm with regret-based pruning in extensive-form games. In the game analysis of Mafia,... J Wang 被引量: 0发表: 0年 Choice processing in emotionally difficult decisions. Presents an extended framework of the standard effort-acc...
Regret-based pruning in extensive-form games Noam BrownTuomas Sandholm Neural Information Processing Systems Dec 2015 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...