Revisiting CFR+ and Alternating Updates

Neil Burch, Matej Moravcik, Martin Schmid

JAIR 2019 pp. 429-443

doi:10.1613/JAIR.1.11370 /jair/2019/burch2019jair-revisiting/

Abstract

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.

PDF JAIR Semantic Scholar

Cite

Text

Burch et al. "Revisiting CFR+ and Alternating Updates." Journal of Artificial Intelligence Research, 2019. doi:10.1613/JAIR.1.11370

Markdown

[Burch et al. "Revisiting CFR+ and Alternating Updates." Journal of Artificial Intelligence Research, 2019.](https://mlanthology.org/jair/2019/burch2019jair-revisiting/) doi:10.1613/JAIR.1.11370

BibTeX

@article{burch2019jair-revisiting,
  title     = {{Revisiting CFR+ and Alternating Updates}},
  author    = {Burch, Neil and Moravcik, Matej and Schmid, Martin},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2019},
  pages     = {429-443},
  doi       = {10.1613/JAIR.1.11370},
  volume    = {64},
  url       = {https://mlanthology.org/jair/2019/burch2019jair-revisiting/}
}