Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent

28 July 2020

Papers citing "Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent"

5 / 5 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 16 0 0 26 Apr 2025
Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms Yang Cai Gabriele Farina Julien Grand-Clément Christian Kroer Chung-Wei Lee Haipeng Luo Weiqiang Zheng 32 6 0 15 Jun 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 14 1 0 01 Nov 2023
A Unified View of Large-scale Zero-sum Equilibrium Computation Kevin Waugh J. Andrew Bagnell 40 25 0 18 Nov 2014
Blackwell Approachability and Low-Regret Learning are Equivalent Jacob D. Abernethy Peter L. Bartlett Elad Hazan 65 108 0 08 Nov 2010