26 search results - page 6 / 6 » Nash equilibria in graphical games on trees revisited |
172
click to vote
AAAI
2012
13 years 8 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...