Numerical scheme for dynkin games under model uncertainty

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.