Skip to main content
Log in

An algorithm for equilibrium selection in generalized Nash equilibrium problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Recently a new solution concept for generalized Nash equilibrium problems was published by the author. This concept selects a reasonable equilibrium out of the typically infinitely many. The idea is to model the process of finding a compromise by solving parametrized generalized Nash equilibrium problems. In this paper we propose an algorithmic realization of the concept. The model produces a solution path, which is under suitable assumptions unique. The algorithm is a homotopy method that tries to follow this path. We use semismooth Newton steps as corrector steps in our algorithm in order to approximately solve the generalized Nash equilibrium problems for each given parameter. If we have a unique solution path, we need three additional theoretical assumptions: a stationarity result for the merit function, a coercivity condition for the constraints, and an extended Mangasarian–Fromowitz constraint qualification. Then we can prove convergence of our semismooth tracing algorithm to the unique equilibrium to be selected. We also present convincing numerical results on a test library of problems from literature. The algorithm also performs well on a number of problems that do not satisfy all the theoretical assumptions.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chen, B., Chen, X., Kanzow, C.: A penalized Fischer–Burmeister NCP-function. Math. Prog. 88, 211–216 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1990)

    Book  MATH  Google Scholar 

  3. De Luca, T., Facchinei, F., Kanzow, C.: A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Program. 75, 407–439 (1996)

    MathSciNet  MATH  Google Scholar 

  4. De Luca, T., Facchinei, F., Kanzow, C.: A theoretical and numerical comparison of some semismooth algorithms for complementarity problems. Comput. Optim. Appl. 16, 173–205 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dreves, A.: Globally Convergent Algorithms for the Solution of Generalized Nash Equilibrium Problems. Dissertation, University of Würzburg (2012). http://opus.bibliothek.uni-wuerzburg.de/volltexte/2012/6982. Accessed 8 Mar 2012

  6. Dreves, A.: How to select a solution in generalized Nash equilibrium problems. J. Optim. Theory Appl. 178(3), 973–997 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dreves, A., Facchinei, F., Kanzow, C., Sagratella, S.: On the solution of the KKT conditions of generalized Nash equilibrium problems. SIAM J. Optim. 21, 1082–1108 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Facchinei, F., Kanzow, C.: Penalty methods for the solution of generalized Nash equilibrium problems. SIAM J. Optim. 20, 2228–2253 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Facchinei, F., Kanzow, C., Karl, S., Sagratella, S.: The semismooth Newton method for the solution of quasi-variational inequalities. Comput. Optim. Appl. 62(1), 85–109 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  10. Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research. Springer, New York (2003)

    MATH  Google Scholar 

  11. Fischer, A., Herrich, M., Schönefeld, K.: Generalized Nash equilibrium problems—recent advances and challenges. Pesqui. Oper. 34, 521–588 (2014)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  13. Harsanyi, J.C.: The tracing procedure: a Bayesian approach to defining a solution for \(n\)-person noncooperative games. Int. J. Game Theory 4, 61–94 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  14. Harsanyi, J.C.: A solution concept for \(n\)-person noncooperative games. Int. J. Game Theory 5, 211–225 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  15. Harsanyi, J.C., Selten, R.: A General Theory of Equilibrium Selection in Games. MIT Press, Cambridge (1988)

    MATH  Google Scholar 

  16. Luo, Z.-Q., Pang, J.-S.: Error bounds for analytic systems and their applications. Math. Program. 67, 1–28 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  17. Nabetani, K., Tseng, P., Fukushima, M.: Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints. Comput. Optim. Appl. 48, 423–452 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Rosen, J.B.: Existence and uniqueness of equilibrium points for concave \(N\)-person games. Econometrica 33, 520–534 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  19. Tullock, G.: Efficient rent seeking. In: Buchanan, J., Tollison, R., Tullock, G. (eds.) Towards a Theory of the Rent-Seeking Society, pp. 97–112. A & M University Press, College Station (1980)

    Google Scholar 

  20. von Heusinger, A.: Numerical methods for the solution of the generalized Nash equilibrium problem. PhD Thesis, Institute of Mathematics, University of Würzburg, Germany (2009)

Download references

Acknowledgements

Many thanks to the referees for their comments that helped to improve the paper. In particular, for the suggestion to use an update strategy for the error bound parameter, that improved the performance of the algorithm.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Axel Dreves.

Ethics declarations

Conflict of interest

I declare that I have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dreves, A. An algorithm for equilibrium selection in generalized Nash equilibrium problems. Comput Optim Appl 73, 821–837 (2019). https://doi.org/10.1007/s10589-019-00086-w

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-019-00086-w

Keywords

Mathematics Subject Classification

Navigation