A numerical algorithm for finding solutions of a generalized Nash equilibrium problem

DOI10.1007/s10589-011-9407-1zbMath1259.91011OpenAlexW2065561219MaRDI QIDQ694603

Wilfredo Sosa, Luiz Carlos Matioli, Jin Yun Yuan

Publication date: 13 December 2012

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://ddd.uab.cat/record/60909

zbMATH Keywords

projection methodsconvex feasibility problemgeneralized Nash equilibrium problem

Mathematics Subject Classification ID

Convex programming (90C25) Noncooperative games (91A10)

Related Items

Exponential augmented Lagrangian methods for equilibrium problems ⋮ Implementation of augmented Lagrangian methods for equilibrium problems ⋮ A globalized Newton method for the computation of normalized Nash equilibria ⋮ Making Augmented Lagrangian Methods Computer Amenable for Equilibrium Problems ⋮ Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications ⋮ Decomposition algorithms for generalized potential games

Cites Work

• Complementarity problems over cones with monotone and pseudomonotone maps
• New existence results for equilibrium problems
• On generalized Nash games and variational inequalities
• On the Existence of General Equilibrium for a Competitive Market
• Nash-Cournot Equilibria in Electric Power Markets with Piecewise Linear Demand Functions and Joint Constraints
• Iterative Algorithms for Equilibrium Problems
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• Existence of an Equilibrium for a Competitive Economy
• Generalized Nash equilibrium problems

This page was built for publication: A numerical algorithm for finding solutions of a generalized Nash equilibrium problem