First-Order (Coarse) Correlated Equilibria in Non-concave Games
Mete Seref Ahunbay
Abstract
We investigate first-order notions of correlated equilibria in smooth games, in which players do not incur any regret against small modifications of their actions prescribed by some vector field. We define two such notions, based on local deviations and on stationarity of the distribution, and identify the notion of coarseness as the setting where the strategy modifications are prescribed by gradient fields. For coarse equilibria, we prove that online (projected) gradient ascent has a universal approximation property for both variants of equilibrium; in the self-play setting, every differentiable function induces an equilibrium constraint, the approximation error of which depends on the modulus of continuity and magnitude of the gradient. In the adversarial setting, we instead obtain a characterisation of regret guarantees against continuous strategy modifications satisfied by projected gradient ascent; these are precisely deviations induced by gradient fields tangent to the action set. We also provide a generalisation of the Lagrangian Hedging framework, which identifies a novel refinement of correlated equilibrium which is tractable to approximate. +We then study the primal-dual framework to our notion of first-order equilibria. For coarse equilibria defined by a family of functions, we find that a dual bound on the worst-case expectation of a performance metric takes the form of a generalised Lyapunov function for the dynamics of the game. Specifically, usual primal-dual price of anarchy analysis for coarse correlated equilibria as well as the smoothness framework of Roughgarden are both equivalent to a problem of general Lyapunov function estimation. For non-coarse equilibria, we instead observe that price of anarchy problems are dual to a vector field fit problem for the gradient dynamics of the game. This follows from containment results in normal form games; the usual notion of a (coarse) correlated equilibria is equivalent to our first-order local notions of (coarse) correlated equilibria with respect to an appropriately chosen set of vector fields.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext dde55bc7-f5a5-4275-aa38-e2ef2ad1bac5Cited by top-tier papers3
- Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and GamesYang Cai, Constantinos Daskalakis, Haipeng Luo, Chen-Yu Wei et al.STOC 2026 · 5 citations
- Expected Variational InequalitiesBrian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker et al.ICML 2025
- On Tractable Φ-Equilibria in Non-Concave GamesYang Cai, Constantinos Daskalakis, Haipeng Luo, Chen-Yu Wei et al.NeurIPS 2024
Builds on12
- Auctions between Regret-Minimizing AgentsYoav Kolumbus, Noam NisanWWW 2022 · 47 citations
- Convergence Analysis of No-Regret Bidding Algorithms in Repeated AuctionsZhe Feng, Guru Guruganesh, Christopher Liaw, Aranyak Mehta et al.AAAI 2021 · 31 citations
- Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient ApproachNadav Hallak, Panayotis Mertikopoulos, Volkan CevherICML 2021 · 24 citations
- The complexity of constrained min-max optimizationConstantinos Daskalakis, Stratis Skoulakis, Manolis ZampetakisSTOC 2021 · 18 citations
- Nash Convergence of Mean-Based Learning Algorithms in First Price AuctionsXiaotie Deng, Xinyan Hu, Tao Lin, Weiqiang ZhengWWW 2022 · 16 citations
Related papers
- Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex GamesConstantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Charilaos Pipis et al.STOC 2025 · 14 citations
- On the Interplay between Social Welfare and Tractability of EquilibriaIoannis Anagnostides, Tuomas SandholmNeurIPS 2023 · 3 citations
- Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix GamesIoannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas SandholmNeurIPS 2022 · 14 citations
- Near-Optimal No-Regret Learning in General GamesConstantinos Daskalakis, Maxwell Fishelson, Noah GolowichNeurIPS 2021 · 141 citations
- Beating Price of Anarchy and Gradient Descent without Regret in Potential GamesIosif Sakos, Stefanos Leonardos, Stelios Andrew Stavroulakis, Will Overman et al.ICLR 2024 · 3 citations
