46 citations · 50 across the 2 of their papers we have counts for
2 papers
cs.GT2012★ 4 cited
An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees
Michael L. Littman, Nishkam Ravi, Arjun Talwar +1
Two-player complete-information game trees are perhaps the simplest possible setting for studying general-sum games and the computational problem of finding equilibria. These games…
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…