mlsanityData to 7 Oct 2026

Learnable Mixed Nash Equilibria are Collectively Rational

arXiv 2510.14907 ↗First posted 16 Oct 2025cs.GT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We extend the study of learning in games to dynamics that exhibit non-asymptotic stability. We do so through the notion of uniform stability, which is concerned with equilibria of individually utility-seeking dynamics. Perhaps surprisingly, it turns out to be closely connected to economic properties of collective rationality. Up to strategic equivalence, if a mixed equilibrium is uniformly stable, then it is weakly Pareto optimal; there is no way for all players to improve by jointly deviating from the equilibrium. This is a form of collective rationality that rules out the types of behaviors in the prisoner's dilemma or the tragedy of the commons. Moreover, we show that uniform stability determines the last-iterate convergence behavior for the family of incremental smoothed best-response dynamics, used to model individual and corporate behaviors in the markets. Unlike dynamics around strict equilibria, which can stabilize to socially-inefficient solutions, individually utility-seeking behaviors near mixed Nash equilibria lead to collective rationality.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 70 references that are in the map. First posted on arXiv 16 Oct 2025.

Builds on

13 of 70 references.

References · 13

  1. 2017Cycles in adversarial regularized learningcited by 122
  2. 2018The Mechanics of n-Player Differentiable Gamescited by 118
  3. 2018Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimizationcited by 97
  4. 2020No-regret learning and mixed Nash equilibria: They do not mixcited by 49
  5. 2019Differentiable Game Mechanicscited by 43
  6. 2022On Last-Iterate Convergence Beyond Zero-Sum Gamescited by 30
  7. 2021Survival of the strictest: Stable and unstable equilibria under regularized learning with partial informationcited by 22
  8. 2013Nash Convergence of Gradient Dynamics in Iterated General-Sum Gamescited by 18
  9. 2018Lyapunov Theory for Discrete Time Systemscited by 15
  10. 2013Payoff Performance of Fictitious Playcited by 4
  11. 2021Stochastic Multiplicative Weights Updates in Zero-Sum Gamescited by 4
  12. 2022Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Gamescited by 4
1 more
  1. 2022Optimistic Gradient Descent Ascent in Zero-Sum and General-Sum Bilinear Gamescited by 3

Built on by

Not cited yet.