On solving generalized Nash equilibrium problems via optimization


This paper deals with the generalized Nash equilibrium problem (GNEP), i.e. a noncooperative game in which the strategy set of each player, as well as his payoff function, depends on the strategies of all players. We consider an equivalent optimization reformulation of GNEP using a regularized Nikaido-Isoda function so that solutions of GNEP coincide with global minima of the optimization problem. We then propose a derivative-free descent type method with inexact line search to solve the equivalent optimization problem and we prove that our algorithm is globally convergent. The convergence analysis is not based on conditions guaranteeing that every stationary point of the optimization problem is a solution of GNEP. Finally, we present the performance of our algorithm on some examples.

DOI: 10.1007/s11590-009-0122-0

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@article{Panicucci2009OnSG, title={On solving generalized Nash equilibrium problems via optimization}, author={Barbara Panicucci and Massimo Pappalardo and Mauro Passacantando}, journal={Optimization Letters}, year={2009}, volume={3}, pages={419-435} }