Skip to main content
Log in

On solving generalized Nash equilibrium problems via optimization

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aubin J.P., Ekeland I.: Applied Nonlinear Analysis. Wiley, New York (1984)

    MATH  Google Scholar 

  2. Auslender A.: Optimization. Méthodes Numériques. Masson, Paris (1976)

    Google Scholar 

  3. Cavazzuti E., Pappalardo M., Passacantando M.: Nash equilibria, variational inequalities, and dynamical systems. J. Optim. Theory Appl. 114, 491–506 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Facchinei F., Fisher A., Piccialli V.: On generalized Nash games and variational inequalities. Oper. Res. Lett. 35, 159–164 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  5. Facchinei F., Kanzow C.: Generalized Nash equilibrium problems. 4OR 5, 173–210 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Harker P.T.: Generalized Nash games and quasi-variational inequalities. Euro. J. Oper. Res. 54, 81–94 (1991)

    Article  MATH  Google Scholar 

  7. Nikaido H., Isoda K.: Note on non-cooperative convex games. Pac. J. Math. 5, 807–815 (1955)

    MathSciNet  Google Scholar 

  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. 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)

    Article  MATH  MathSciNet  Google Scholar 

  10. Uryasev S., Rubinstein R.Y.: On relaxation algorithms in computation of noncooperative equilibria. IEEE Trans. Automat. Contr. 39, 1263–1267 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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)

  13. Zhu D.L., Marcotte P.: Modified descent methods for solving the monotone variational inequality problem. Oper. Res. Lett. 14, 111–120 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Massimo Pappalardo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Panicucci, B., Pappalardo, M. & Passacantando, M. On solving generalized Nash equilibrium problems via optimization. Optim Lett 3, 419–435 (2009). https://doi.org/10.1007/s11590-009-0122-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-009-0122-0

Keywords

Navigation