Pith. sign in

REVIEW 4 major objections 4 minor 35 references

Existence of Solutions for Non-monotone Variational Inequalities and Implications for Games

T0 review · 4 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper proves that a coercive normal map whose generalized Jacobian has full rank yields a solution to any non-monotone variational inequality, then applies this to games and Nash equilibria.

desk verdict Theorem 6 is a clean, correct extension of the authors' earlier unconstrained result, but the constrained/game applications rest on a projection-Jacobian containment claim that is false for boxes. read the letter →

arxiv 2512.16141 v2 pith:I5LYYL2Y submitted 2025-12-18 math.OC

Sina Arefizadeh , Angelia Nedić This is my paper · ORCID
classification math.OC MSC 49J4091A1090C33
keywords variationalinequalitiesnormalmappinggeneralizedJacobiannormcoercivitynon-monotoneVIsNashequilibriumquasi-NashP-matrixcondition
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper is trying to establish a new existence theorem for variational inequalities whose defining map is not monotone. The central result says: if the normal map F^nor_K(x) = x − Π_K[x] + F(Π_K[x]) is norm coercive and its generalized Jacobian has maximal rank wherever F^nor_K is nonzero, then VI(K,F) has a solution. The proof reduces the constrained problem to finding a zero of the normal map, then uses a Clarke inverse function theorem to rule out a positive minimum of the norm. The paper then gives conditions on F and K — uniform P-function, uniform P-matrix, and PΥ-matrix conditions — under which these hypotheses hold, and shows in games that those conditions force strong convexity of each player's cost in her own variable, so solutions are Nash equilibria. A sympathetic reader will care because this offers an existence route for non-monotone problems where classical monotonicity-based results are silent.

What carries the argument

The normal mapping F^nor_K(x) = x − Π_K[x] + F(Π_K[x]) converts the constrained VI into an unconstrained root-finding problem: x* solves VI(K,F) iff F^nor_K(v)=0 for some v with x* = Π_K[v]. The generalized Jacobian ∂F^nor_K — the convex hull of limits of Jacobians at nearby differentiable points — together with Clarke's inverse function theorem supplies local invertibility off the zero set. A scaling trick (replace F by tF, t>0) is used to force the generalized Jacobian of the normal map to have full rank on the boundary while preserving the solution set.

What would settle it

Check K=[0,∞)^2 at x=(0,0). Sequences approaching the origin from the interior give projection Jacobian I, while sequences from the strictly negative quadrant give diag(0,0); so diag(0,0) ∈ ∂Π_K[0]. But every matrix in Conv({I − e_1e_1^T, I − e_2e_2^T, I}) has trace at least 1, whereas diag(0,0) has trace 0. Exhibiting diag(0,0) as a convex combination of matrices in G would refute this; otherwise Theorem 7 cannot be applied as stated to box action sets.

Watch

Extended reading notes

Core claim

The paper's central claim is Theorem 6: for a nonempty closed convex set K and continuously differentiable F, if the normal mapping F^nor_K(x) = x − Π_K[x] + F(Π_K[x]) is norm coercive and its generalized Jacobian has maximal rank at every x where F^nor_K(x) ≠ 0, then VI(K,F) has a solution. The proof minimizes the norm of the normal map and uses the Clarke inverse function theorem to show the minimum cannot be positive. The paper also gives conditions on F and K under which these hypotheses are met, and in the game setting shows that the uniform P-matrix and PΥ-matrix conditions imply each player's cost is strongly convex in her own variable, so every solution to the VI formulation is actua

Load-bearing premise

The whole path from Theorem 6 to box/interval-constrained games passes through the assertion, made after Theorem 7 without proof, that for x outside the interior of a Cartesian product of one-dimensional closed convex sets the generalized Jacobian of the projection satisfies ∂Π_K[x] ⊆ Conv({I − e_i e_i^T} ∪ {I}); this is false for K=[0,∞)^2 at x=(0,0), so that path collapses.

Editorial extensions

If this is right

  • Theorem 6 gives a new existence certificate: check norm coercivity of the normal map plus full rank of its generalized Jacobian, and a solution to the constrained VI exists without monotonicity.
  • Under the uniform P-function property on a Cartesian product set, all principal submatrices of ∇F have singular values uniformly bounded below, so the hypotheses of Theorem 7 are met after scaling by t.
  • In games, the uniform P-matrix condition on the game Jacobian implies each player's cost is strongly convex in her own variable; hence quasi-Nash equilibria coincide with Nash equilibria, and existence follows.
  • The PΥ-matrix condition yields a unique Nash equilibrium without separately requiring Lipschitz gradients or convexity of costs.
  • Examples show the conditions of Theorem 6 can be checked where uniform P-function and PΥ-matrix conditions fail, so the existence result covers VIs those criteria miss.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper's claimed extension to box/interval action sets relies on the assertion after Theorem 7 that ∂Π_K[x] ⊆ Conv(G) for Cartesian products of one-dimensional closed convex sets; that assertion has no proof in the paper and fails at the origin of [0,∞)^2, so the chain from Theorem 6 to box-constrained Nash existence is currently incomplete.
  • A concrete testable repair would be to prove or disprove the inclusion ∂Π_K[x] ⊆ Conv(G) for polyhedral sets; the trace obstruction suggests the inclusion may hold only for very special sets, or that a different rank argument is needed on the boundary.
  • The scaling-by-t argument suggests a computational avenue: instead of checking P-properties, one could certify coercivity and full-rank for large t, then use homotopy or continuation to locate the root of the normal map.
  • In nonconvex games, the PŁ-type condition of Theorem 11 upgrades quasi-Nash equilibria to Nash equilibria, so combining a quasi-Nash existence certificate with gradient dominance may give Nash existence without convexity.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper studies existence of solutions to non-monotone variational inequalities VI(K,F) through the normal mapping F_K^nor(x)=x-Π_K[x]+F(Π_K[x]). Theorem 6 proves that if F_K^nor is norm coercive and its generalized Jacobian has maximal rank at every point where F_K^nor(x)≠0, then VI(K,F) has a solution. The paper then provides sufficient conditions for these hypotheses in terms of uniform P-function and uniform P-matrix conditions, and applies the results to games, claiming existence of quasi-Nash and Nash equilibria for constrained action sets. The central mechanism for the constrained case is Theorem 7, which needs the assumption ∂Π_K[x]⊆Conv(G) for x∉K°, where G={I−e_i e_i^⊤}∪{I}, and the paper asserts this assumption holds for Cartesian products of one-dimensional closed convex sets. The rest of the paper, including Section 4, builds on this assertion to obtain game-theoretic consequences.

Significance. If correct, the main existence result Theorem 6 would be a useful and clean extension of the unconstrained result in Theorem 1, and the paper contains instructive examples showing that existing uniform P-function and PΥ-matrix conditions fail for simple linear mappings. The proof of Theorem 6 itself is a clean application of Clarke's inverse mapping theorem and is not implicated in the main defect. However, the advertised extension to constrained VIs and games is carried by Theorem 7 and the verification chain based on ∂Π_K[x]⊆Conv(G), and that assumption is false. The specific counterexample K=[0,∞)^2 shows the claimed theorem-level conclusion also fails for a simple linear, full-rank, constant-Jacobian mapping. Consequently the central constrained-set and game-theoretic claims of the paper are not established.

major comments (4)
  1. [§3.3, Theorem 7 and the paragraph after it] The assertion that ∂Π_K[x]⊆Conv(G) holds when K is a Cartesian product of one-dimensional closed convex sets is false. For K=[0,∞)^2 at x=(0,0), the projection is Π_K(y)=(max(y1,0),max(y2,0)); approaching from the negative quadrant gives diag(0,0)∈∂Π_K(0). But every matrix in Conv(G) has the form I−β diag(α_1,...,α_m) with α_i≥0, Σα_i=1, β∈[0,1], hence trace ≥ m−1 = 1, while diag(0,0) has trace 0. This invalidates the constrained-set verification chain used to extend Theorem 6 to box/interval action sets and to the game results in Section 4.
  2. [§3.3, Theorem 7] The intended conclusion of Theorem 7 is itself false for a natural case. Let K=[0,∞)^2 and F(x)=Ax with A=[[1,2],[3,1]]. Then ∇F is constant, full rank, and all principal minors are nonzero; however, at x=(1,0), (tF)_K^nor(x)=(1+t,3t)≠0. For every γ∈[0,1], the matrix J=I+(tA−I)diag(1,γ) lies in ∂(tF)_K^nor(x), and det J=t(1−γ(5t+1)). Choosing γ=1/(5t+1)∈(0,1) gives a singular matrix in the generalized Jacobian for every t>0. Thus no single t>0 makes ∂(tF)_K^nor(x) maximal rank everywhere, despite F satisfying all the Jacobian-side hypotheses in Theorem 7 except the false Conv(G) containment. This shows the gap is not a missing proof but a fundamental problem for a basic class of constrained sets.
  3. [§2.2, Theorem 3(a), proof] The proof uses the step: for a vector w with w_i=v_i on M and w_i=0 off M, 'for some small enough ϵ>0, x+ϵw(x)∈K or x−ϵw(x)∈K'. This is false for Cartesian products of intervals when w has mixed signs. For K=[0,∞)^2, x=(0,0), and w=(1,−1), neither x+ϵw=(ϵ,−ϵ) nor x−ϵw=(−ϵ,ϵ) belongs to K. Hence the constructed y_ϵ may not lie in K, and the mean-value / uniform-P-function argument does not go through as written. Even if the final statement can be repaired by a more careful directional argument, the proof is currently invalid.
  4. [§4, paragraph after Theorem 9] The game-theoretic existence conclusions rely on the sentence that 'the conditions of Theorem 7 are satisfied' for Cartesian products of one-dimensional action sets. Since the ∂Π_K[x]⊆Conv(G) containment is false and Theorem 7's conclusion fails for the linear counterexample above, the chain leading to existence of quasi-Nash equilibria for constrained games is not established. The only worked example, Example 2, uses K=R^2, i.e., the unconstrained case, so it does not illustrate the constrained/game claim.
minor comments (4)
  1. [§3.1, proof of Theorem 6] The reference to 'Clark Inverse' should be 'Clarke's inverse function theorem'.
  2. [§4.1, proof of Theorem 9] There is a typo in 'K=K_1×...×K_N n'; the intended dimension is ar n or a similar notation.
  3. [Figures 1 and 2] The figures are referenced only loosely; it would help to state the corresponding implication formally in the surrounding text.
  4. [Examples 1 and 2] Both examples are unconstrained (K=R^2) and therefore do not test the paper's constrained-set theorem; this could be stated explicitly so readers are not misled.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the main existence proof is self-contained; the constrained-game extension rests on an unproved (indeed false) projection-Jacobian containment, which is a soundness gap and not a circular derivation.

full rationale

The load-bearing existence result, Theorem 6, is not derived from its conclusion. Its proof starts from a minimizing sequence for inf ||F_nor_K||, uses norm coercivity to get boundedness, and invokes Clarke's inverse theorem plus Facchinei-Pang's normal-map zero characterization (Theorem 4) to contradict a positive infimum. No step assumes that VI(K,F) has a solution, and no parameter is fitted to the conclusion. The self-citations [3], [4] appear in the introduction and in the statement of the unconstrained Theorem 1, but Theorem 6 is proved without relying on them; [3] is used only as context and as the K=R^m special case. Thus there is no self-citation chain that forces the central claim. The principal weakness is the assertion just after Theorem 7 that the condition ∂Π_K[x]⊆Conv(G) holds for every Cartesian product of one-dimensional closed convex sets; this is asserted without proof and is in fact violated for K=[0,∞)^2 at x=(0,0), where diag(0,0)∈∂Π_K[x] but every matrix in Conv(G) has trace at least 1. That is an unsupported (and false) assumption in the constrained-set verification chain, not a circular identification of output with input. It affects soundness, not circularity, and it does not implicate Theorem 6's own proof structure. Score reflects only minor, non-load-bearing self-citations; no circular steps are exhibited.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no new entities or fitted parameters. Its main mathematical engine is Clarke's generalized Jacobian and the normal mapping, both standard. The ad hoc projection-Jacobian containment is the one non-standard axiom, and it is both unproven and false for the stated example class.

assumptions (5)
  • standard math Clarke inverse function theorem (Theorem 1 of [7]): if every matrix in ∂F(x) is nonsingular, F is locally invertible around x with Lipschitz inverse.
    Used in the proof of Theorem 6 to derive a contradiction from a positive infimum of ||F_K^nor||.
  • standard math Normal-mapping characterization (Proposition 1.5.9 of [10]): x*∈SOL(K,F) iff x*=Π_K[v] and F_K^nor(v)=0 for some v.
    Bridges zeros of the normal mapping to solutions of the VI in Theorem 6.
  • standard math Projection inequality (Lemma 12.1.13(a) of [10]) for closed convex sets, used in Lemma 2.
    Provides the lower bound on ⟨x_i-y_i, Πx_i-Πy_i⟩ - ||Πx_i-Πy_i||^2 needed for norm coercivity.
  • domain assumption Uniform P-matrix and uniform P-function definitions and Proposition 3c/3b from [27].
    These are external conditions on the mapping/Jacobian imported from the prior literature; the paper builds on them.
  • ad hoc to paper For all x∉K°, ∂Π_K[x] ⊆ Conv(G), where G={I-e_i e_i^T}∪{I}.
    This is the pivotal assumption of Theorem 7. The paper claims it holds for Cartesian products of intervals, but no proof is given and the claim is false for simple boxes (e.g., K=[0,∞)^2, diag(0,0)∈∂Π but not in Conv(G)).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Existence of Solutions for Non-monotone Variational Inequalities and Implications for Games." pith.science (2026). https://pith.science/paper/I5LYYL2Y

@misc{pith2026251216141,
  author       = {Pith},
  title        = {Pith review of: Existence of Solutions for Non-monotone Variational Inequalities and Implications for Games},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/I5LYYL2Y}},
  note         = {Machine review of arXiv:2512.16141}
}
abstract

In this paper, we study the existence of solutions in non-monotone variational inequalities (VIs) through the normal mapping properties. In particular, we provide sufficient conditions for the existence of solutions assuming that the normal mapping associated with the VI is norm coercive and its generalized Jacobian has certain properties, such as a full rank at points where the normal mapping is not zero. Then, we investigate sufficient conditions for the VI mapping and its Jacobian that ensure the generalized Jacobian of the normal mapping has full rank, such as the uniform P-function and the uniform P-matrix condition. Subsequently, we focus on VIs arising from games and interpret our results in a game setting and provide a sufficient condition for a game to have a Nash equilibrium. Through examples, we show that our sufficient conditions can be used to assert the existence of a solution to a VI, or a quasi-Nash in a game, while the existing results relying on the uniform P-function property or the P$_\Upsilon$-matrix condition cannot be employed.

Figures

Figures reproduced from arXiv: 2512.16141 by the authors.

Figure 1
Figure 1. Implications of the uniform P-function property for the conditions on Jacobian used in Theorem 7. [PITH_FULL_IMAGE:figures/full_fig_p012_1.png] view at source ↗
Figure 2
Figure 2. Relation of the uniform P-matrix property to our results. [PITH_FULL_IMAGE:figures/full_fig_p015_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

35 extracted references

  1. [1]

    Springer, 2007

    Fuad Aleskerov, Denis Bouyssou, and Bernard Monjardet.Utility maximization, choice and preference. Springer, 2007

    2007

  2. [2]

    A distributed algorithm for aggregative games on directed communication graphs

    Sina Arefizadeh and Angelia Nedi´c. A distributed algorithm for aggregative games on directed communication graphs. In2022 IEEE 61st Conference on Decision and Control (CDC), pages 6407–6412. IEEE, 2022. 17 APREPRINT- DECEMBER19, 2025

    2022

  3. [3]

    Non-monotone variational inequalities

    Sina Arefizadeh and Angelia Nedi ´c. Non-monotone variational inequalities. In2024 60th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 1–7. IEEE, 2024

    2024

  4. [4]

    On non-monotone variational inequalities

    Sina Arefizadeh and Angelia Nedi´c. On non-monotone variational inequalities. Preprint arXiv:2510.02724, 2025

    arXiv 2025

  5. [5]

    Quasi nash equilibrium in low interaction network games

    Sina Arefizadeh, Angelia Nedi´c, Sadegh Arefizadeh, and Zhan Shu. Quasi nash equilibrium in low interaction network games. In2025 American Control Conference (ACC), pages 2901–2906, 2025

    2025

  6. [6]

    Tracking-based distributed equilibrium seeking for aggregative games.IEEE Transactions on Automatic Control, 69(9):6026–6041, 2024

    Guido Carnevale, Filippo Fabiani, Filiberto Fele, Kostas Margellos, and Giuseppe Notarstefano. Tracking-based distributed equilibrium seeking for aggregative games.IEEE Transactions on Automatic Control, 69(9):6026–6041, 2024

    2024

  7. [7]

    On the inverse function theorem.Pacific Journal of Mathematics, 64(1):97–102, 1976

    Francis Clarke. On the inverse function theorem.Pacific Journal of Mathematics, 64(1):97–102, 1976

    1976

  8. [8]

    SIAM, 1990

    Frank H Clarke.Optimization and nonsmooth analysis. SIAM, 1990

    1990

Show all 35 references
  1. [9]

    United we fall: On the nash equilibria of multiplex and multilayer network games.IEEE Transactions on Control of Network Systems, pages 1238–1250, 2025

    Raman Ebrahimi and Parinaz Naghizadeh. United we fall: On the nash equilibria of multiplex and multilayer network games.IEEE Transactions on Control of Network Systems, pages 1238–1250, 2025

    2025

  2. [10]

    Springer, 2003

    Francisco Facchinei and Jong-Shi Pang.Finite-dimensional variational inequalities and complementarity problems. Springer, 2003

    2003

  3. [11]

    On matrices with non-positive off-diagonal elements and positive principal minors.Czechoslovak Mathematical Journal, 12:382–400, 1962

    Miroslav Fiedler and Vlastimil Ptak. On matrices with non-positive off-diagonal elements and positive principal minors.Czechoslovak Mathematical Journal, 12:382–400, 1962

    1962

  4. [12]

    A generalized iterative water-filling algorithm for distributed power control in the presence of a jammer.IEEE Transactions on Signal Processing, 57(7):2660–2674, 2009

    Ramy H Gohary, Yao Huang, Zhi-Quan Luo, and Jong-Shi Pang. A generalized iterative water-filling algorithm for distributed power control in the presence of a jammer.IEEE Transactions on Signal Processing, 57(7):2660–2674, 2009

    2009

  5. [13]

    Nash-cournot equilibria in electric power markets with piecewise linear demand functions and joint constraints.Operations Research, 55(1):113–127, 2007

    Benjamin F Hobbs and Jong-Shi Pang. Nash-cournot equilibria in electric power markets with piecewise linear demand functions and joint constraints.Operations Research, 55(1):113–127, 2007

    2007

  6. [14]

    Beyond monotone variational inequalities: solution methods and iteration complexities.Pacific Journal of Optimization, 20(3):403–428, 2024

    Kevin Huang and Shuzhong Zhang. Beyond monotone variational inequalities: solution methods and iteration complexities.Pacific Journal of Optimization, 20(3):403–428, 2024

    2024

  7. [15]

    Support functions of the clarke generalized jacobian and of its plenary hull.Nonlinear Analysis: Theory, Methods & Applications, 49(8):1111–1125, 2002

    Cyril Imbert. Support functions of the clarke generalized jacobian and of its plenary hull.Nonlinear Analysis: Theory, Methods & Applications, 49(8):1111–1125, 2002

    2002

  8. [16]

    SIAM, 2000

    David Kinderlehrer and Guido Stampacchia.An introduction to variational inequalities and their applications. SIAM, 2000

    2000

  9. [17]

    Mathematics in Science and Engineering, C

    Igor Konnov.Equilibrium Models and Variational Inequalities, volume 210 ofser. Mathematics in Science and Engineering, C. K. Chui ed.Amsterdam, The Netherlands: Elsevier, 2007

    2007

  10. [18]

    Rongjiang Li, Guanpu Chen, Die Gan, Haibo Gu, and Jinhu Lü. Stackelberg and nash equilibrium computation in non-convex leader-follower network aggregative games.IEEE Transactions on Circuits and Systems I: Regular Papers, 71(2):898–909, 2023

    2023

  11. [19]

    Cambridge University Press, 1996

    Zhi-Quan Luo, Jong-Shi Pang, and Daniel Ralph.Mathematical programs with equilibrium constraints. Cambridge University Press, 1996

    1996

  12. [20]

    A variational approach to network games

    Emerson Melo. A variational approach to network games. 2018

    2018

  13. [21]

    SIAM, 2023

    Carl D Meyer.Matrix analysis and applied linear algebra. SIAM, 2023

    2023

  14. [22]

    On the uniqueness and stability of equilibria of network games

    Parinaz Naghizadeh and Mingyan Liu. On the uniqueness and stability of equilibria of network games. In2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 280–286. IEEE, 2017

    2017

  15. [23]

    Infinite dimensional clarke generalized jacobian.Journal of Convex Analysis, 14(2):433–454, 2007

    Zsolt Páles and Vera Zeidan. Infinite dimensional clarke generalized jacobian.Journal of Convex Analysis, 14(2):433–454, 2007

    2007

  16. [24]

    Infinite dimensional generalized jacobian: properties and calculus rules.Journal of mathematical analysis and applications, 344(1):55–75, 2008

    Zsolt Páles and Vera Zeidan. Infinite dimensional generalized jacobian: properties and calculus rules.Journal of mathematical analysis and applications, 344(1):55–75, 2008

    2008

  17. [25]

    Nonconvex games with side constraints.SIAM Journal on Optimization, 21(4):1491–1522, 2011

    Jong-Shi Pang and Gesualdo Scutari. Nonconvex games with side constraints.SIAM Journal on Optimization, 21(4):1491–1522, 2011

    2011

  18. [26]

    Joint sensing and power allocation in nonconvex cognitive radio games: Quasi-nash equilibria.IEEE Transactions on Signal Processing, 61(9):2366–2382, 2013

    Jong-Shi Pang and Gesualdo Scutari. Joint sensing and power allocation in nonconvex cognitive radio games: Quasi-nash equilibria.IEEE Transactions on Signal Processing, 61(9):2366–2382, 2013

    2013

  19. [27]

    A variational inequality framework for network games: Existence, uniqueness, convergence and sensitivity analysis.Games and Economic Behavior, 114:47–82, 2019

    Francesca Parise and Asuman Ozdaglar. A variational inequality framework for network games: Existence, uniqueness, convergence and sensitivity analysis.Games and Economic Behavior, 114:47–82, 2019

    2019

  20. [28]

    Gradient methods for the minimisation of functionals.USSR Computational Mathematics and Mathematical Physics, 3(4):864–878, 1963

    Boris T Polyak. Gradient methods for the minimisation of functionals.USSR Computational Mathematics and Mathematical Physics, 3(4):864–878, 1963. 18 APREPRINT- DECEMBER19, 2025

    1963

  21. [29]

    Generalized nash equilibrium seeking for aggregative games over weight-unbalanced digraphs

    Qiangren Qu, Yao Xiao, Tieqiang Gang, and Lijie Chen. Generalized nash equilibrium seeking for aggregative games over weight-unbalanced digraphs. In2025 37th Chinese Control and Decision Conference (CCDC), pages 2593–2599. IEEE, 2025

    2025

  22. [30]

    Liang Ran, Huaqing Li, Lifeng Zheng, Jun Li, Zhe Li, and Jinhui Hu. Distributed generalized nash equilibria computation of noncooperative games via novel primal-dual splitting algorithms.IEEE Transactions on Signal and Information Processing over Networks, 10:179–194, 2024

    2024

  23. [31]

    Characterization and computation of local nash equilibria in continuous games

    Lillian J Ratliff, Samuel A Burden, and Shankar S Sastry. Characterization and computation of local nash equilibria in continuous games. In2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 917–924. IEEE, 2013

    2013

  24. [32]

    On the characterization of solution sets of smooth and nonsmooth convex stochastic nash games.SIAM Journal on Optimization, 21(3):1168–1199, 2011

    Uma Ravat and Uday V Shanbhag. On the characterization of solution sets of smooth and nonsmooth convex stochastic nash games.SIAM Journal on Optimization, 21(3):1168–1199, 2011

    2011

  25. [33]

    Existence and uniqueness of equilibrium points for concave n-person games.Econometrica: Journal of the Econometric Society, pages 520–534, 1965

    Judah Ben Rosen. Existence and uniqueness of equilibrium points for concave n-person games.Econometrica: Journal of the Econometric Society, pages 520–534, 1965

    1965

  26. [34]

    Convex optimization, game theory, and variational inequality theory.IEEE Signal Processing Magazine, 27(3):35–49, 2010

    Gesualdo Scutari, Daniel P Palomar, Francisco Facchinei, and Jong-Shi Pang. Convex optimization, game theory, and variational inequality theory.IEEE Signal Processing Magazine, 27(3):35–49, 2010

    2010

  27. [35]

    A behavioral model of rational choice.The quarterly journal of economics, pages 99–118, 1955

    Herbert A Simon. A behavioral model of rational choice.The quarterly journal of economics, pages 99–118, 1955. 19

    1955

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.