On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games

Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis. On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. In Venkatesan Guruswami, editor, 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA. Volume 287 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]

Abstract

Abstract is missing.