Paths to constrained Nash equilibria
DOI10.1007/BF01314819zbMath0805.90122OpenAlexW1968095245MaRDI QIDQ2366977
Publication date: 15 August 1993
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01314819
Lagrange multipliersdifferential inclusionsvariational inequalitiesNash equilibriasteepest-descentconstrained, non-cooperative gamessteepest-ascent
Noncooperative games (91A10) Nonlinear programming (90C30) Variational inequalities (49J40) Nonsmooth analysis (49J52) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Openness of the metric projection in certain Banach spaces
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- A trajectory-followed method for unconstrained optimization
- Metric Projections and the Gradient Projection Method in Banach Spaces
- Optimization and nonsmooth analysis
- Continuous algorithms for solution of convex optimization problems and finding saddle points of contex-coneave functions with the use of projection operations
- The Gradient Projection Method Using Curry’s Steplength
- Global Regularity Theorems
- A Theory of Dynamic Oligopoly, II: Price Competition, Kinked Demand Curves, and Edgeworth Cycles
- Application of the method of Lyapunov functions to the study of the convergence of numerical methods
- The method of lyapunov functions in the study of continuous algorithms of mathematical programming
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Convex Analysis
- On the Maximality of Sums of Nonlinear Monotone Operators
This page was built for publication: Paths to constrained Nash equilibria