46 citations · 46 across the 1 of their papers we have counts for
2 papers
cs.GT2013
Regret Minimization in Non-Zero-Sum Games with Applications to Building Champion Multiplayer Computer Poker Agents
Richard Gibson
In two-player zero-sum games, if both players minimize their average external regret, then the average of the strategy profiles converges to a Nash equilibrium. For n-player genera…
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…