2 papers
cs.GT2023
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games
Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm +1
Characterizing the performance of no-regret dynamics in multi-player games is a foundational problem at the interface of online learning and game theory. Recent results have reveal…
cs.GT2022
Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria
Ioannis Anagnostides, Gabriele Farina, Christian Kroer +2
A recent emerging trend in the literature on learning in games has been concerned with providing faster learning dynamics for correlated and coarse correlated equilibria in normal-…