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

DOI10.1007/s10589-011-9407-1zbMath1259.91011MaRDI 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 methods; convex feasibility problem; generalized Nash equilibrium problem

Mathematics Subject Classification ID

90C25: Convex programming

91A10: Noncooperative games

Related Items

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

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