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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Ioannis Anagnostides' in GoogleThis author has not been identified. Look up 'Alkis Kalavasis' in GoogleThis author has not been identified. Look up 'Tuomas Sandholm' in GoogleThis author has not been identified. Look up 'Manolis Zampetakis' in Google

runs on WebDSL