Adjusted Sublevel Sets, Normal Operator, and Quasi-convex Programming
SIAM Journal on Optimization
On generalized Nash games and variational inequalities
Operations Research Letters
Decomposition algorithms for generalized potential games
Computational Optimization and Applications
| Hi-index | 0.00 |
It is well known that the generalized Nash equilibrium problem, a model for multi-leader-follower games, can be reformulated as a quasivariational inequality. We show that, in fact, a reformulation in terms of a variational inequality can be obtained in the general setting of quasiconvex nondifferentiable decision functions. An existence result is deduced.