Regret Matching+: (In)Stability and Fast Convergence in Games

24 May 2023

Papers citing "Regret Matching+: (In)Stability and Fast Convergence in Games"

6 / 6 papers shown

Title
Approximating Nash Equilibria in General-Sum Games via Meta-Learning David Sychrovský Christopher Solinas Revan MacQueen Kevin Wang James Wright Nathan R Sturtevant Michael Bowling 21 0 0 26 Apr 2025
Asynchronous Predictive Counterfactual Regret Minimization $^+$ Algorithm in Solving Extensive-Form Games Linjian Meng Youzhi Zhang Zhenxing Ge Tianpei Yang Yang Gao 36 0 0 17 Mar 2025
Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent Hang Xu Kai Li Bingyun Liu Haobo Fu Qiang Fu Junliang Xing Jian Cheng 28 3 0 22 Apr 2024
Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games Yang Cai Gabriele Farina Julien Grand-Clément Christian Kroer Chung-Wei Lee Haipeng Luo Weiqiang Zheng 28 1 0 01 Nov 2023
Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent Yu Bai Chi Jin Song Mei Ziang Song Tiancheng Yu OffRL 60 19 0 30 May 2022
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent Gabriele Farina Christian Kroer T. Sandholm 51 72 0 28 Jul 2020