Sciweavers

26 search results - page 6 / 6
» Nash equilibria in graphical games on trees revisited
Sort
View
84
Voted
AAAI
2012
12 years 11 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...