Robust Equilibria in Continuous Games: From Strategic to Dynamic Robustness
Kyriakos Lotidis, Panayotis Mertikopoulos, Nicholas Bambos, Jose H. Blanchet
Abstract
In this paper, we examine the robustness of Nash equilibria in continuous games, under both strategic and dynamic uncertainty. Starting with the former, we introduce the notion of a robust equilibrium as those equilibria that remain invariant to small -- but otherwise arbitrary -- perturbations to the game's payoff structure, and we provide a crisp geometric characterization thereof. Subsequently, we turn to the question of dynamic robustness, and we examine which equilibria may arise as stable limit points of the dynamics of"follow the regularized leader"(FTRL) in the presence of randomness and uncertainty. Despite their very distinct origins, we establish a structural correspondence between these two notions of robustness: strategic robustness implies dynamic robustness, and, conversely, the requirement of strategic robustness cannot be relaxed if dynamic robustness is to be maintained. Finally, we examine the rate of convergence to robust equilibria as a function of the underlying regularizer, and we show that entropically regularized learning converges at a geometric rate in games with affinely constrained action spaces.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- (Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential GamesIoannis Anagnostides, Ioannis Panageas, Nikolas Patris, Tuomas SandholmICML 2026 · 2 citations
- What Preferences Can—and Cannot—Predict in Multi-Agent Online LearningOmar Abbadi, Rida Laraki, Panayotis MertikopoulosICML 2026
Builds on8
- Global Convergence of Multi-Agent Policy Gradient in Markov Potential GamesStefanos Leonardos, Will Overman, Ioannis Panageas, Georgios PiliourasICLR 2022 · 158 citations
- No-Regret Learning and Mixed Nash Equilibria: They Do Not MixEmmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Thanasis Lianeas, Panayotis Mertikopoulos et al.NeurIPS 2020 · 100 citations
- The Limits of Min-Max Optimization Algorithms: Convergence to Spurious Non-Critical SetsYa-Ping Hsieh, Panayotis Mertikopoulos, Volkan CevherICML 2021 · 96 citations
- No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separationYu-Guan Hsieh, Kimon Antonakopoulos, Volkan Cevher, Panayotis MertikopoulosNeurIPS 2022 · 38 citations
- On the convergence of policy gradient methods to Nash equilibria in general stochastic gamesAngeliki Giannou, Kyriakos Lotidis, Panayotis Mertikopoulos, Emmanouil V. Vlatakis-GkaragkounisNeurIPS 2022 · 28 citations
Related papers
- The impact of uncertainty on regularized learning in gamesPierre-Louis Cauvin, Davide Legacci, Panayotis MertikopoulosICML 2025
- The convergence rate of regularized learning in games: From bandits and uncertainty to optimism and beyondAngeliki Giannou, Emmanouil V. Vlatakis-Gkaragkounis, Panayotis MertikopoulosNeurIPS 2021 · 19 citations
- Multi-Agent Learning under Uncertainty: Recurrence vs. ConcentrationKyriakos Lotidis, Panayotis Mertikopoulos, Nicholas Bambos, José H. BlanchetNeurIPS 2025 · 1 citation
- No-regret Learning in Harmonic Games: Extrapolation in the Face of Conflicting InterestsDavide Legacci, Panayotis Mertikopoulos, Christos H. Papadimitriou, Georgios Piliouras et al.NeurIPS 2024 · 10 citations
- The Equivalence of Dynamic and Strategic Stability under Regularized Learning in GamesVictor Boone, Panayotis MertikopoulosNeurIPS 2023 · 9 citations
