pith. sign in

arxiv: 1411.4438 · v2 · pith:K3L3Y4GXnew · submitted 2014-11-17 · 🧮 math.OC · math.PR· q-fin.MF

Solving finite time horizon Dynkin games by optimal switching

classification 🧮 math.OC math.PRq-fin.MF
keywords optimalswitchingdynkingamehorizonrecentresultstime
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.