Optimization Letters

, Volume 3, Issue 3, pp 419–435 | Cite as

On solving generalized Nash equilibrium problems via optimization

  • Barbara Panicucci
  • Massimo Pappalardo
  • Mauro Passacantando
Original Paper


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.


Generalized Nash equilibrium problem Nikaido–Isoda function Descent method 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aubin J.P., Ekeland I.: Applied Nonlinear Analysis. Wiley, New York (1984)zbMATHGoogle Scholar
  2. 2.
    Auslender A.: Optimization. Méthodes Numériques. Masson, Paris (1976)Google Scholar
  3. 3.
    Cavazzuti E., Pappalardo M., Passacantando M.: Nash equilibria, variational inequalities, and dynamical systems. J. Optim. Theory Appl. 114, 491–506 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Facchinei F., Fisher A., Piccialli V.: On generalized Nash games and variational inequalities. Oper. Res. Lett. 35, 159–164 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Facchinei F., Kanzow C.: Generalized Nash equilibrium problems. 4OR 5, 173–210 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Harker P.T.: Generalized Nash games and quasi-variational inequalities. Euro. J. Oper. Res. 54, 81–94 (1991)zbMATHCrossRefGoogle Scholar
  7. 7.
    Nikaido H., Isoda K.: Note on non-cooperative convex games. Pac. J. Math. 5, 807–815 (1955)MathSciNetGoogle Scholar
  8. 8.
    Panicucci, B., Pappalardo, M., Passacantando, M.: A globally convergent descent method for nonsmooth variational inequalities. Comput. Optim. Appl. (2007). doi: 10.1007/s10589-007-9132-y
  9. 9.
    Solodov M.V., Tseng P.: Some methods based on the D-gap function for solving monotone variational inequalities. Comput. Optim. Appl. 17, 255–277 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Uryasev S., Rubinstein R.Y.: On relaxation algorithms in computation of noncooperative equilibria. IEEE Trans. Automat. Contr. 39, 1263–1267 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    von Heusinger, A., Kanzow, C.: Optimization reformulations of the generalized Nash equilibrium problem using Nikaido–Isoda-type functions. Comput. Optim. Appl. (2007). doi: 10.1007/s10589-007-9145-6
  12. 12.
    von Heusinger, A., Kanzow, C.: Relaxation methods for generalized Nash equilibrium problem with inexact line search. Preprint 282, Institute of Mathematics, University of Würzburg, Würzburg, February (2008)Google Scholar
  13. 13.
    Zhu D.L., Marcotte P.: Modified descent methods for solving the monotone variational inequality problem. Oper. Res. Lett. 14, 111–120 (1993)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  • Barbara Panicucci
    • 1
  • Massimo Pappalardo
    • 1
  • Mauro Passacantando
    • 1
  1. 1.Department of Applied MathematicsUniversity of PisaPisaItaly

Personalised recommendations