IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i1p560-586.html
   My bibliography  Save this article

Dynkin Games with Incomplete and Asymmetric Information

Author

Listed:
  • Tiziano De Angelis

    (University of Torino and Collegio Carlo Alberto, School of Management and Economis, 10134 Torino, Italy)

  • Erik Ekström

    (Department of Mathematics, Uppsala University, 75106 Uppsala, Sweden)

  • Kristoffer Glover

    (University of Technology Sydney, New South Wales 2007, Australia)

Abstract

We study the value and the optimal strategies for a two-player zero-sum optimal stopping game with incomplete and asymmetric information. In our Bayesian setup, the drift of the underlying diffusion process is unknown to one player (incomplete information feature), but known to the other one (asymmetric information feature). We formulate the problem and reduce it to a fully Markovian setup where the uninformed player optimises over stopping times and the informed one uses randomised stopping times in order to hide their informational advantage. Then we provide a general verification result that allows us to find the value of the game and players’ optimal strategies by solving suitable quasi-variational inequalities with some nonstandard constraints. Finally, we study an example with linear payoffs, in which an explicit solution of the corresponding quasi-variational inequalities can be obtained.

Suggested Citation

  • Tiziano De Angelis & Erik Ekström & Kristoffer Glover, 2022. "Dynkin Games with Incomplete and Asymmetric Information," Mathematics of Operations Research, INFORMS, vol. 47(1), pages 560-586, February.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:1:p:560-586
    DOI: 10.1287/moor.2021.1141
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1141
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1141?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
    ---><---

    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:inm:ormoor:v:47:y:2022:i:1:p:560-586. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.