A SNCP Method for Solving Equilibrium Problems with Equilibrium Constraints
This paper studies algorithms for equilibrium problems with equilibrium constraints (EPECs). We present a generalization of Scholtesâ€™s regularization scheme for MPECs and extend his convergence results to this new relaxation method. We propose a sequential nonlinear complementarity (SNCP) algorithm to solve EPECs and establish the convergence of this algorithm. We present numerical results comparing the SNCP algorithm and diagonalization (nonlinear Gauss- Seidel and nonlinear Jacobi) methods on randomly generated EPEC test problems. The computational experience to date shows that both the SNCP algorithm and the nonlinear Gauss-Seidel method outperform the nonlinear Jacobi method
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Berry, Carolyn A. & Hobbs, Benjamin F. & Meroney, William A. & O'Neill, Richard P. & StewartJr, William R., 1999. "Understanding how market power can arise in network competition: a game theoretic approach," Utilities Policy, Elsevier, vol. 8(3), pages 139-158, September.
- Cardell, Judith B. & Hitt, Carrie Cullen & Hogan, William W., 1997. "Market power and strategic interaction in electricity networks," Resource and Energy Economics, Elsevier, vol. 19(1-2), pages 109-137, March.
When requesting a correction, please mention this item's handle: RePEc:sce:scecf5:150. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.