Approximation to optimization problems: an elementary review
Mathematics of Operations Research
Some Noninterior Continuation Methods for LinearComplementarity Problems
SIAM Journal on Matrix Analysis and Applications
Computational Optimization and Applications
A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints
Computational Optimization and Applications
Variational convergence of bivariate functions: lopsided convergence
Mathematical Programming: Series A and B - Nonlinear convex optimization and variational inequalities
Approximations of Nash equilibria
Mathematical Programming: Series A and B
Operations Research Letters
Hi-index | 0.00 |
The equilibrium problem with equilibrium constraints (EPEC) can be looked on as a generalization of Nash equilibrium problem (NEP) and the mathematical program with equilibrium constraints (MPEC) whose constraints contain a parametric variational inequality or complementarity system. In this paper, we particularly consider a special class of EPECs where a common parametric P-matrix linear complementarity system is contained in all players' strategy sets. After reformulating the EPEC as an equivalent nonsmooth NEP, we use a smoothing method to construct a sequence of smoothed NEPs that approximate the original problem. We consider two solution concepts, global Nash equilibrium and stationary Nash equilibrium, and establish some results about the convergence of approximate Nash equilibria. Moreover we show some illustrative numerical examples.