Lazy-CFR: fast and near-optimal regret minimization for extensive games with imperfect information.
Yichi ZhouTongzheng RenJialian LiDong YanJun ZhuPublished in: ICLR (2020)
Keyphrases
- imperfect information
- regret minimization
- game theoretic
- nash equilibrium
- game theory
- opponent modeling
- nash equilibria
- game tree search
- perfect information
- decision problems
- card game
- game playing
- imperfect information games
- fictitious play
- game tree
- trust model
- alternating time temporal logic
- computational complexity
- resource allocation
- statistically significant