Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games

25 April 2023

Papers citing "Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games"

2 / 2 papers shown

Title
Computational Lower Bounds for Regret Minimization in Normal-Form Games Ioannis Anagnostides Alkis Kalavasis T. Sandholm 34 0 0 04 Nov 2024
Frank-Wolfe Algorithms for Saddle Point Problems Gauthier Gidel Tony Jebara Simon Lacoste-Julien 42 70 0 25 Oct 2016