Numerical scheme for Dynkin games under model uncertainty

From MaRDI portal
Publication:1663906

DOI10.1214/18-EJP198zbMATH Open1415.91037arXiv1707.00033MaRDI QIDQ1663906FDOQ1663906

Yan Dolinsky, Benjamin Gottesman

Publication date: 24 August 2018

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1707.00033




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Numerical scheme for Dynkin games under model uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663906)