Numerical scheme for dynkin games under model uncertainty

Yan Dolinsky, Benjamin Gottesman

Research output: Contribution to journalArticlepeer-review


We introduce an efficient numerical scheme for continuous time Dynkin games under model uncertainty. We use the Skorokhod embedding in order to construct recombining tree approximations. This technique allows us to determine convergence rates and to construct numerically optimal stopping strategies. We apply our method to several examples of game options.

Original languageAmerican English
Article number74
JournalElectronic Journal of Probability
StatePublished - 2018

Bibliographical note

Publisher Copyright:
© 2018, University of Washington. All rights reserved.


  • Dynkin games
  • Game options
  • Model uncertainty
  • Skorokhod embedding


Dive into the research topics of 'Numerical scheme for dynkin games under model uncertainty'. Together they form a unique fingerprint.

Cite this