IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v159y2013i3d10.1007_s10957-012-0210-7.html
   My bibliography  Save this article

On Intrinsic Complexity of Nash Equilibrium Problems and Bilevel Optimization

Author

Listed:
  • D. Dorsch

    (RWTH Aachen University)

  • H. T. Jongen

    (RWTH Aachen University)

  • V. Shikhman

    (Catholic University of Louvain (UCL))

Abstract

In this article we study generalized Nash equilibrium problems (GNEP) and bilevel optimization side by side. This perspective comes from the crucial fact that both problems heavily depend on parametric issues. Observing the intrinsic complexity of GNEP and bilevel optimization, we emphasize that it originates from unavoidable degeneracies occurring in parametric optimization. Under intrinsic complexity, we understand the involved geometrical complexity of Nash equilibria and bilevel feasible sets, such as the appearance of kinks and boundary points, non-closedness, discontinuity and bifurcation effects. The main goal is to illustrate the complexity of those problems originating from parametric optimization and singularity theory. By taking the study of singularities in parametric optimization into account, the structural analysis of Nash equilibria and bilevel feasible sets is performed. For GNEPs, the number of players’ common constraints becomes crucial. In fact, for GNEPs without common constraints and for classical NEPs we show that—generically—all Nash equilibria are jointly nondegenerate Karush–Kuhn–Tucker points. Consequently, they are isolated. However, in presence of common constraints Nash equilibria will constitute a higher dimensional set. In bilevel optimization, we describe the global structure of the bilevel feasible set in case of a one-dimensional leader’s variable. We point out that the typical discontinuities of the leader’s objective function will be caused by follower’s singularities. The latter phenomenon occurs independently of the viewpoint of the optimistic or pessimistic approach. In case of higher dimensions, optimistic and pessimistic approaches are discussed with respect to possible bifurcation of the follower’s solutions.

Suggested Citation

  • D. Dorsch & H. T. Jongen & V. Shikhman, 2013. "On Intrinsic Complexity of Nash Equilibrium Problems and Bilevel Optimization," Journal of Optimization Theory and Applications, Springer, vol. 159(3), pages 606-634, December.
    • Handle: RePEc:spr:joptap:v:159:y:2013:i:3:d:10.1007_s10957-012-0210-7
    DOI: 10.1007/s10957-012-0210-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0210-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-012-0210-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Holger Scheel & Stefan Scholtes, 2000. "Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 1-22, February.
    2. Francisco Facchinei & Christian Kanzow, 2010. "Generalized Nash Equilibrium Problems," Annals of Operations Research, Springer, vol. 175(1), pages 177-211, March.
    3. Jong-Shi Pang & Masao Fukushima, 2005. "Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games," Computational Management Science, Springer, vol. 2(1), pages 21-56, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vladimir Shikhman, 2022. "On local uniqueness of normalized Nash equilibria," Papers 2205.13878, arXiv.org.
    2. Sreekumaran, Harikrishnan & Hota, Ashish R. & Liu, Andrew L. & Uhan, Nelson A. & Sundaram, Shreyas, 2021. "Equilibrium strategies for multiple interdictors on a common network," European Journal of Operational Research, Elsevier, vol. 288(2), pages 523-538.
    3. Lorenzo Lampariello & Simone Sagratella, 2017. "A Bridge Between Bilevel Programs and Nash Games," Journal of Optimization Theory and Applications, Springer, vol. 174(2), pages 613-635, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alexey Izmailov & Mikhail Solodov, 2014. "On error bounds and Newton-type methods for generalized Nash equilibrium problems," Computational Optimization and Applications, Springer, vol. 59(1), pages 201-218, October.
    2. Migot, Tangi & Cojocaru, Monica-G., 2020. "A parametrized variational inequality approach to track the solution set of a generalized nash equilibrium problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1136-1147.
    3. Ming Hu & Masao Fukushima, 2011. "Variational Inequality Formulation of a Class of Multi-Leader-Follower Games," Journal of Optimization Theory and Applications, Springer, vol. 151(3), pages 455-473, December.
    4. Han, Deren & Zhang, Hongchao & Qian, Gang & Xu, Lingling, 2012. "An improved two-step method for solving generalized Nash equilibrium problems," European Journal of Operational Research, Elsevier, vol. 216(3), pages 613-623.
    5. Shipra Singh & Aviv Gibali & Simeon Reich, 2021. "Multi-Time Generalized Nash Equilibria with Dynamic Flow Applications," Mathematics, MDPI, vol. 9(14), pages 1-23, July.
    6. Addis Belete Zewde & Semu Mitiku Kassa, 2021. "Multilevel multi-leader multiple-follower games with nonseparable objectives and shared constraints," Computational Management Science, Springer, vol. 18(4), pages 455-475, October.
    7. Jiawang Nie & Xindong Tang & Lingling Xu, 2021. "The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials," Computational Optimization and Applications, Springer, vol. 78(2), pages 529-557, March.
    8. Axel Dreves & Simone Sagratella, 2020. "Nonsingularity and Stationarity Results for Quasi-Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 185(3), pages 711-743, June.
    9. Francisco Facchinei & Jong-Shi Pang & Gesualdo Scutari, 2014. "Non-cooperative games with minmax objectives," Computational Optimization and Applications, Springer, vol. 59(1), pages 85-112, October.
    10. J. S. Pang, 2007. "Partially B-Regular Optimization and Equilibrium Problems," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 687-699, August.
    11. Christian Kanzow & Daniel Steck, 2018. "Augmented Lagrangian and exact penalty methods for quasi-variational inequalities," Computational Optimization and Applications, Springer, vol. 69(3), pages 801-824, April.
    12. Stein, Oliver & Sudermann-Merx, Nathan, 2018. "The noncooperative transportation problem and linear generalized Nash games," European Journal of Operational Research, Elsevier, vol. 266(2), pages 543-553.
    13. Axel Dreves, 2016. "Improved error bound and a hybrid method for generalized Nash equilibrium problems," Computational Optimization and Applications, Springer, vol. 65(2), pages 431-448, November.
    14. Axel Dreves & Francisco Facchinei & Andreas Fischer & Markus Herrich, 2014. "A new error bound result for Generalized Nash Equilibrium Problems and its algorithmic application," Computational Optimization and Applications, Springer, vol. 59(1), pages 63-84, October.
    15. Giancarlo Bigi & Mauro Passacantando, 2016. "Gap functions for quasi-equilibria," Journal of Global Optimization, Springer, vol. 66(4), pages 791-810, December.
    16. Jian Yao & Ilan Adler & Shmuel S. Oren, 2008. "Modeling and Computing Two-Settlement Oligopolistic Equilibrium in a Congested Electricity Network," Operations Research, INFORMS, vol. 56(1), pages 34-47, February.
    17. L. F. Bueno & G. Haeser & F. Lara & F. N. Rojas, 2020. "An Augmented Lagrangian method for quasi-equilibrium problems," Computational Optimization and Applications, Springer, vol. 76(3), pages 737-766, July.
    18. Allevi, E. & Conejo, A.J. & Oggioni, G. & Riccardi, R. & Ruiz, C., 2018. "Evaluating the strategic behavior of cement producers: An equilibrium problem with equilibrium constraints," European Journal of Operational Research, Elsevier, vol. 264(2), pages 717-731.
    19. Aghamohammadloo, Hossein & Talaeizadeh, Valiollah & Shahanaghi, Kamran & Aghaei, Jamshid & Shayanfar, Heidarali & Shafie-khah, Miadreza & Catalão, João P.S., 2021. "Integrated Demand Response programs and energy hubs retail energy market modelling," Energy, Elsevier, vol. 234(C).
    20. Atsushi Hori & Masao Fukushima, 2019. "Gauss–Seidel Method for Multi-leader–follower Games," Journal of Optimization Theory and Applications, Springer, vol. 180(2), pages 651-670, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:159:y:2013:i:3:d:10.1007_s10957-012-0210-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.