Numerical scheme for Dynkin games under model uncertainty

From MaRDI portal
Publication:1663906




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.



Cites work







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)