IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v14y2024i2d10.1007_s13235-023-00491-1.html
   My bibliography  Save this article

Bilevel Nash Equilibrium Problems: Numerical Approximation Via Direct-Search Methods

Author

Listed:
  • Francesco Caruso

    (University of Naples Federico II)

  • Maria Carmela Ceparano

    (University of Naples Federico II)

  • Jacqueline Morgan

    (University of Naples Federico II
    Centre for Studies in Economics and Finance (CSEF))

Abstract

We address the numerical approximation of bilevel problems where a Nash equilibrium has to be determined both in the upper level and in the lower level. Widely applied in engineering and economic frameworks, such models are an extension of the well-known Stackelberg duopoly model and of the classical bilevel optimization problem. In this paper, the lower level involves a nonparametric ratio-bounded game (as introduced by Caruso, Ceparano and Morgan in CSEF Working Papers 593, 2020) and the upper level involves a potential game (as introduced by Monderer and Shapley in Games Econ. Behav. 14, 1996). After presenting existence and uniqueness results for the solutions of such bilevel Nash equilibrium problems, we define a numerical method relying on a derivative-free unconstrained optimization technique connected to direct-search methods. The associate algorithm is shown to globally converge toward a solution; error estimations, rates of convergence and illustrative examples are also provided.

Suggested Citation

  • Francesco Caruso & Maria Carmela Ceparano & Jacqueline Morgan, 2024. "Bilevel Nash Equilibrium Problems: Numerical Approximation Via Direct-Search Methods," Dynamic Games and Applications, Springer, vol. 14(2), pages 305-332, May.
    • Handle: RePEc:spr:dyngam:v:14:y:2024:i:2:d:10.1007_s13235-023-00491-1
    DOI: 10.1007/s13235-023-00491-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-023-00491-1
    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/s13235-023-00491-1?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.

    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:dyngam:v:14:y:2024:i:2:d:10.1007_s13235-023-00491-1. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.