atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Robust Equilibria in Continuous Games: From Strategic to Dynamic Robustness

NeurIPS 2025 · Learning theory and algorithms › Submodular and game algorithms · approach: Correlated equilibria in sequential games · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Defines strategic robustness of equilibria in continuous games via gradient-field perturbations, characterizes it geometrically, and shows it is equivalent to dynamic robustness under FTRL with constant step-size (sufficient and essentially necessary), with geometric convergence for entropic regularization under affine constraints.

Problem

Which equilibria of continuous games remain robust both to small perturbations of the payoff structure (strategic robustness) and arise as stable limit points of noisy FTRL learning dynamics (dynamic robustness)?

Approach

Measure game perturbations by the sup distance between individual payoff gradient fields rather than payoff values; define strategically robust equilibria as those invariant under small gradient perturbations, show this is equivalent to the gradient lying in the interior of the polar cone, and prove that such equilibria attract FTRL with high probability under stochastic gradient or payoff-based (

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use FTRL with sufficiently small step-size and stochastic gradient feedbackStrategically robust equilibria in continuous games · Continuous gamesconvergence probability: ≥1-confHelped
Use SPSA payoff-based feedback with mix_n proportional to 1/n^mixexp, mixexp in (0,1/2), and sufficiently small step-sizeStrategically robust equilibria in continuous games · Continuous gamesconvergence probability: ≥1-confHelped
Use SPSA payoff-based feedback under affine constraints and a decomposable regularizerFTRL at a strategically robust equilibrium · Affinely constrained domainsconvergence rate: rate(-Θ(n))Helped
Use a decomposable regularizer on a polyhedral domainFTRL at a strategically robust equilibrium · Polyhedral domainsconvergence rate: rate(-Θ(n))Helped
Use an entropic regularizerFTRL at a strict Nash equilibrium · Simplexconvergence rate: exp(-Θ(n))Helped
Apply FTRL with i.i.d. noise having positive-definite covariance at an interior equilibriumInterior Nash equilibria · Continuous gamesprobability of convergence: 0Hurt
Use an entropic regularizer instead of the regularizer -2√xFTRL in the one-player game with payoff -3/4 x^(4/3) · [0,1], equilibrium 0probability of convergence to 0: 1 -> 0Hurt
Use the regularizer -2√x instead of an entropic regularizerFTRL in the one-player game with payoff -3/4 x^(4/3) · [0,1], equilibrium 0probability of convergence to 0: 0 -> 1Helped

Surprising findings

Limitations

Experimental setup

Metrics: convergence to equilibrium convergence rate

Baselines: projected gradient ascent / stochastic gradient ascent vanishing step-size FTRL in concave games

Builds on: follow-the-regularized-leader stochastic approximation SPSA evolutionary stability of strict equilibria

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy