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

$$\varepsilon $$ ε -Nash Equilibria of a Multi-player Nonzero-Sum Dynkin Game in Discrete Time

Author

Listed:
  • Said Hamadène

    (Le Mans Université, LMM)

  • Mohammed Hassani

    (Université Cadi Ayyad)

  • Marie-Amélie Morlais

    (Le Mans Université, LMM)

Abstract

We study the infinite horizon discrete time N-player nonzero-sum Dynkin game ( $$N\ge 2$$ N ≥ 2 ) with stopping times as strategies (or pure strategies). We prove existence of an $$\varepsilon $$ ε -Nash equilibrium point for the game by presenting a constructive algorithm. One of the main features is that the payoffs of the players depend on the set of players that stop at the termination stage which is the minimal stage in which at least one player stops. The existence result is extended to the case of a nonzero-sum game with finite horizon. Finally, the algorithm is illustrated by two explicit examples in the specific case of finite horizon.

Suggested Citation

  • Said Hamadène & Mohammed Hassani & Marie-Amélie Morlais, 2024. "$$\varepsilon $$ ε -Nash Equilibria of a Multi-player Nonzero-Sum Dynkin Game in Discrete Time," Dynamic Games and Applications, Springer, vol. 14(3), pages 642-664, July.
  • Handle: RePEc:spr:dyngam:v:14:y:2024:i:3:d:10.1007_s13235-023-00500-3
    DOI: 10.1007/s13235-023-00500-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-023-00500-3
    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-00500-3?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:3:d:10.1007_s13235-023-00500-3. 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.