Stability and perfection of Nash equilibria
Stability and perfection of Nash equilibria
Piecewise functions in nonsmooth analysis
Nonlinear Analysis: Theory, Methods & Applications
Directional derivatives of the solution of a parametric nonlinear program
Mathematical Programming: Series A and B
Piecewise smoothness, local invertibility, and parametric analysis of normal maps
Mathematics of Operations Research
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
SIAM Journal on Optimization
Algorithmic Game Theory
Approximations of Nash equilibria
Mathematical Programming: Series A and B
Generalized Nash equilibrium problems and Newton methods
Mathematical Programming: Series A and B
Computational Optimization and Applications
Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
SIAM Journal on Optimization
Computational Optimization and Applications
Computational Optimization and Applications
Game-Theoretic analysis of internet switching with selfish users
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Mathematical Programming: Series A and B
| Hi-index | 0.00 |
Using a regularized Nikaido-Isoda function, we present a (nonsmooth) constrained optimization reformulation of the player convex generalized Nash equilibrium problem (GNEP). Further we give an unconstrained reformulation of a large subclass of player convex GNEPs which, in particular, includes the jointly convex GNEPs. Both approaches characterize all solutions of a GNEP as minima of optimization problems. The smoothness properties of these optimization problems are discussed in detail, and it is shown that the corresponding objective functions are continuous and piecewise continuously differentiable under mild assumptions. Some numerical results based on the unconstrained optimization reformulation being applied to player convex GNEPs are also included.