Stable-Predictive Optimistic Counterfactual Regret Minimization

arXiv: Computer Science and Game Theory, 2019.

Cited by: 8|Bibtex|Views50
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

The CFR framework has been a powerful tool for solving large-scale extensive-form games in practice. However, the theoretical rate at which past CFR-based algorithms converge to the Nash equilibrium is on the order of $O(T^{-1/2})$, where $T$ is the number of iterations. In contrast, first-order methods can be used to achieve a $O(T^{-1})...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments