Revisiting CFR+ and Alternating Updates
| Autor: | Burch, Neil, Moravcik, Matej, Schmid, Martin |
|---|---|
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | Journal of Artificial Intelligence Research 64 (2019) 429-443 |
| Druh dokumentu: | Working Paper |
| Popis: | The CFR+ algorithm for solving imperfect information games is a variant of the popular CFR algorithm, with faster empirical performance on a range of problems. It was introduced with a theoretical upper bound on solution error, but subsequent work showed an error in one step of the proof. We provide updated proofs to recover the original bound. Comment: 15 pages, 0 figures. Published in JAIR, Feb. 2019 |
| Databáze: | arXiv |
| Externí odkaz: |
|