Lazy-CFR: fast and near optimal regret minimization for extensive games
with imperfect information

Lazy-CFR: fast and near optimal regret minimization for extensive games with imperfect information

10 October 2018

Jun Zhu

Papers citing "Lazy-CFR: fast and near optimal regret minimization for extensive games with imperfect information"

5 / 5 papers shown

Title
Learning not to Regret David Sychrovský Michal Sustr Elnaz Davoodi Michael Bowling Marc Lanctot Martin Schmid 29 3 0 02 Mar 2023
Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent Yu Bai Chi Jin Song Mei Ziang Song Tiancheng Yu OffRL 52 19 0 30 May 2022
Near-Optimal Learning of Extensive-Form Games with Imperfect Information Yunru Bai Chi Jin Song Mei Tiancheng Yu 21 26 0 03 Feb 2022
Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms Kaipeng Zhang Zhuoran Yang Tamer Basar 55 1,180 0 24 Nov 2019
Blackwell Approachability and Low-Regret Learning are Equivalent Jacob D. Abernethy Peter L. Bartlett Elad Hazan 78 114 0 08 Nov 2010