Recognition: 1 theorem link
· Lean TheoremStability of Lagrangian Generalized Nash Equilibriums
Pith reviewed 2026-05-11 01:06 UTC · model grok-4.3
The pith
The Aubin property and isolated calmness of Lagrangian generalized Nash equilibrium solution mappings are characterized using coderivatives of normal cone mappings for conically constrained problems.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
For general conically constrained generalized Nash equilibrium problems, characterizations of the Aubin property and isolated calmness of the LGNE solution mapping under canonical perturbations are established using the coderivative and graph derivative of normal cone mappings. These general results are specialized to GNEPs with equality and inequality constraints, yielding explicit characterizations described by nonsingularity of linear complementarity systems. Similar results hold for shared conic constraints and classical Nash equilibrium problems.
What carries the argument
The coderivative and graph derivative of normal cone mappings to the conic constraint sets, which encode conditions for the Aubin property and isolated calmness of the LGNE solution mapping.
Load-bearing premise
The constraint sets must be closed convex cones and standard constraint qualifications must hold so that the normal cone mappings are well-defined and the coderivative calculus applies.
What would settle it
A specific conically constrained GNEP where the coderivative condition holds but the LGNE solution mapping fails to satisfy the Aubin property under canonical perturbations would disprove the claimed characterization.
read the original abstract
Lagrangian generalized Nash equilibriums (LGNEs) were introduced by Rockafellar (2024) for a class of generalized Nash equilibrium problems (GNEPs) in which each player's strategy is subject to conic constraints. This paper investigates the stability properties of the LGNE solution set, specifically focusing on the Aubin property, isolated calmness, and Lipschitz continuous single-valued localization. For general conically constrained GNEPs, characterizations of the Aubin property and isolated calmness of the LGNE solution mapping under canonical perturbations are established. These characterizations are formulated using the coderivative and graph derivative of normal cone mappings. Subsequently, these general results are specialized to GNEPs with equality and inequality constraints, yielding explicit characterizations for both the Lipschitz continuous single-valued localization and isolated calmness of the corresponding LGNE solution mapping, which are described by nonsingularity of linear complementarity sytems. For GNEPs with shared conic constraints, the Aubin property and isolated calmness of the consensus LGNE solution mapping--where identical Lagrange multipliers are assigned to the shared constraint--are first characterized. We further analyze the case when the conic constraints are specialized as equalities and inequalities. Finally, for classical conically constrained Nash equilibrium problems, the Aubin property and isolated calmness of the Lagrangian Nash equilibrium solution mapping are also analyzed.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops stability analysis for Lagrangian generalized Nash equilibria (LGNEs) arising in generalized Nash equilibrium problems (GNEPs) whose strategy sets are defined by closed convex cones. It establishes coderivative-based characterizations of the Aubin property and isolated calmness of the LGNE solution mapping under canonical perturbations. These general results are then specialized to polyhedral (equality/inequality) constraints, where the conditions reduce to nonsingularity of associated linear complementarity systems, and to the shared-constraint and classical Nash cases.
Significance. If the derivations are correct, the work supplies a coherent variational-analytic framework for stability questions in conically constrained GNEPs. The explicit linear-complementarity criteria obtained for the polyhedral case are potentially useful for both theoretical verification and algorithmic design. The paper correctly invokes standard coderivative calculus under the stated closed-convex-cone and constraint-qualification hypotheses, and the absence of circularity or ad-hoc parameters strengthens the contribution.
minor comments (4)
- [Abstract] Abstract: 'linear complementarity sytems' contains a typographical error and should read 'systems'.
- [Section 2] The precise statement of the constraint qualifications needed for the normal-cone mappings to be well-defined and for the coderivative calculus to apply should be collected in a single preliminary subsection or theorem statement rather than being referenced only in passing.
- [Section 3] Notation for the graph derivative of the normal-cone mapping is introduced without an explicit comparison to the standard limiting coderivative; a brief remark clarifying the relationship would aid readers unfamiliar with the distinction.
- [Section 4] The paper would benefit from a short numerical example (even a low-dimensional linear-complementarity instance) illustrating the nonsingularity test derived in the polyhedral case.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of our manuscript and the recommendation for minor revision. The referee's summary accurately reflects the paper's focus on coderivative characterizations of the Aubin property and isolated calmness for LGNE solution mappings in conically constrained GNEPs, along with the specializations to polyhedral and shared-constraint cases.
Circularity Check
No significant circularity detected
full rationale
The paper's central results characterize the Aubin property and isolated calmness of the LGNE solution mapping via coderivatives and graph derivatives of normal-cone mappings. These are standard, externally established tools from variational analysis, applied under the usual hypotheses of closed convex cones and constraint qualifications that make the calculus rules valid. The definition of LGNEs is credited to an external reference (Rockafellar 2024), and the subsequent specializations to polyhedral cases and shared-constraint settings follow directly from the general theorems without introducing any self-referential definitions, fitted inputs renamed as predictions, or load-bearing self-citations. The derivation chain therefore remains independent of its target stability conclusions.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math Coderivative and graph-derivative calculus for normal-cone mappings to closed convex sets holds under the usual qualification conditions of variational analysis.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/RealityFromDistinction.lean; Cost/FunctionalEquation.leanreality_from_one_distinction; washburn_uniqueness_aczel unclearcharacterizations ... formulated using the coderivative and graph derivative of normal cone mappings ... nonsingularity of linear complementarity systems
Reference graph
Works this paper leans on
-
[1]
K. J. Arrow and G. Debreu, Existence of an equilibrium for a competitive economy, Econo- metrica, 22(1954), 265–290
1954
-
[2]
J. F. Bonnans and C. H. Ram ´ırez, Perturbation analysis of second order cone programming problems, Mathematical Programming, Series B, 104(2005), 205–227
2005
-
[3]
J. F. Bonnans, and A. Shapiro, Perturbation Analysis of Optimization Problems, Springer, New York, 2000
2000
-
[4]
Z. X. Chan and D. F. Sun, Constraint nondegeneracy, strong regularity and nonsingularity in semidefinite programming, SIAM Journal on Optimization, 19(2008),370–396
2008
-
[5]
Liang Chen, Ruoning Chen, Defeng Sun, and Junyuan Zhu, Aubin property and strong reg- ularity are equivalent for nonlinear second-order cone programming, SIAM Journal on Opti- mization 35:2 (2025) 712-738
2025
-
[6]
Liang Chen, Ruoning Chen, Defeng Sun, and Liping Zhang, Equivalent characterizations of the Aubin property for nonlinear semidefinite programming, Mathematical Programming (2025), https://doi.org/10.1007/s10107-025-02231-2 29
-
[7]
Ruoyu Diao, Yu-Hong Dai and Liwei Zhang, Stability for Nash Equilibrium Problems, Math. Oper. Res., https://doi.org/10.1287/moor.2024.0609 (2025)
-
[8]
Ding, D.F
C. Ding, D.F. Sun and L.W. Zhang, Characterization of the robust isolated calmness for a class of conic programming problems, SIAM J. Optim., 27 (2017), 67–90
2017
-
[9]
A. L. Dontchev and R. T. Rockafellar, Implicit Functions and Solution Mappings: A View from Variational Analysis, Springer, New York, 2009
2009
-
[10]
A. L. Dontchev and R. T. Rockafellar, Characterizations of Lipschitzian stability in nonlin- ear programming. in Mathematical Programming With Data Perturbations, A.V . Fiacco, ed., Marcel Dekker, New York, 1997, 65–82
1997
-
[11]
A. L. Dontchev and R. T. Rockafellar, Characterizations of strong regularity for variational inequalities over polyhedral convex sets, SIAM J. Optim., 6 (1996), 1087–1105
1996
-
[12]
Facchinei and C
F. Facchinei and C. Kanzow, Generalized Nash equilibrium problems, Ann. Oper. Res., 175 (2010), 177–211
2010
-
[13]
H. Th. Jongen, J. Ruckmann, and K. Tammer, Implicit functions and sensitivity of stationary points, Mathematical Programming, 49 (1990), 123–138
1990
-
[14]
King and R
A. King and R. T. Rockafellar, Sensitivity analysis for nonsmooth generalized equations, Mathematical Programming, 55 (1992) 341–364
1992
-
[15]
Kojima, A
M. Kojima, A. Okada and S. Shindoh, Strongly stable equilibrium points of n-person nonco- operative games, Math. Oper. Res., 10 (1985), 650–663
1985
-
[16]
Levy, Implicit multifunction theorems for the sensitivity analysis of variational condi- tions
A.B. Levy, Implicit multifunction theorems for the sensitivity analysis of variational condi- tions. Mathematical Programming, 74 (1996), 333–350
1996
-
[17]
J.W. Nie, X.D. Tang, Nash Equilibrium Problems of Polynomials, Mathematics of Operations ResearchV ol, 49:2, https://doi.org/10.1287/moor.2022.0334
-
[18]
S. M. Robinson, Generalized equations and their solutions, Part II: Applications to nonlinear programming, Math. Program. Study, 19 (1982), 200–221
1982
-
[19]
S. M. Robinson, Strongly regular generalized equations, Math. Oper. Res., 5 (1980),43–62
1980
-
[20]
S. M. Robinson, Some continuity properties of polyhedral multifunctions, Mathematical Pro- gramming Study, 14 (1981), 206–214
1981
-
[21]
S. M. Robinson, Generalized Equations and Their Solutions, Part II: Applications to Nonlinear Programming,Mathematical Programming Study 19 (1982), 200–221
1982
-
[22]
Facchinei and C
F. Facchinei and C. Kanzow, Generalized Nash equilibrium problems, Ann. Oper. Res., 175(2010),177–211
2010
-
[23]
Nash, Non-cooperative games, Annals of Mathematics, 54(1951),286–295
J. Nash, Non-cooperative games, Annals of Mathematics, 54(1951),286–295
1951
-
[24]
R. T. Rockafellar and R. J. -B. Wets, Variational Analysis, Springer-Verlag, New York, 1998. 30
1998
-
[25]
R. T. Rockafellar,Variational analysis of Nash equilibrium, Vietnamese Journal of Mathemat- ics, 46 (2017), 73–85
2017
-
[26]
R. T. Rockafellar, Generalized Nash equilibrium from a robustness perspective in variational analysis, Set-Valued and Variational Analysis, 32:19 (2024), https://doi.org/10.1007/s11228- 024-00722-6
-
[27]
D. F. Sun, The strong second order sufficient condition and constraint nondegeneracy in non- linear semidefinite programming and their implications, Math. Oper. Res., 31(2006), 761–776
2006
-
[28]
Wang and L
Y . Wang and L. W. Zhang, Properties of Equation Reformulation of the Karush-Kuhn-Tucker Condition for Nonlinear Second Order Cone Optimization Problems. Mathematical Methods of Operations Research, Math Meth Oper. Res., 70 (2009), 195–218
2009
-
[29]
Zhang, L
Y . Zhang, L. W. Zhang, J. Wu and K. D. Wang, Characterizations of local upper Lips- chitz property of perturbed solutions to nonlinear second-order cone programs, Optimization 66(2017),1079–1103
2017
-
[30]
Zhang and L
Y .L. Zhang and L. W. Zhang, On the upper Lipschitz property of the KKT mapping for non- linear semidefinite optimization, Operations Research Letter, 44 (2016), 474–478. 31
2016
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.