Solving finite time horizon Dynkin games by optimal switching

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper uses recent results on continuous-time finite-horizon optimal switching problems with negative switching costs to prove the existence of a saddle point in an optimal stopping (Dynkin) game. Sufficient conditions for the game's value to be continuous with respect to the time horizon are obtained using recent results on norm estimates for doubly reflected backward stochastic differential equations. This theory is then demonstrated numerically for the special cases of cancellable call and put options in a Black-Scholes market.

Cite

CITATION STYLE

APA

Martyr, R. (2016). Solving finite time horizon Dynkin games by optimal switching. Journal of Applied Probability, 53(4), 957–973. https://doi.org/10.1017/jpr.2016.57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free