Lazy-CFR: a fast regret minimization algorithm for extensive games with imperfect information.

Yichi Zhou Tongzheng Ren Jialian Li Dong Yan Jun Zhu

Published in: CoRR (2018)

Keyphrases

regret minimization
game theoretic
imperfect information
nash equilibrium
learning algorithm
linear programming
computational complexity
fictitious play
game tree
decision making
game theory
matching algorithm
np hard
search space
optimal solution
monte carlo
imperfect information games