Strategy-Based Warm Starting for Regret Minimization in Games

AAAI, pp. 432-438, 2016.

Cited by: 11|Bibtex|Views23
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

Counterfactual Regret Minimization (CFR) is a popular iterative algorithm for approximating Nash equilibria in imperfect-information multi-step two-player zero-sum games. We introduce the first general, principled method for warm starting CFR. Our approach requires only a strategy for each player, and accomplishes the warm start at the co...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments