Erhan Bayraktar, Masahiko Egami
Published 2007-07-01, updated 2009-05-25Version 3
We explicitly solve the optimal switching problem for one-dimensional diffusions by directly employing the dynamic programming principle and the excessive characterization of the value function. The shape of the value function and the smooth fit principle then can be proved using the properties of concave functions.
Comments: Keywords: Optimal switching problem, optimal stopping problem, It\^{o} diffusions
Dynamic Programming Principles for Optimal Stopping with Expectation Constraint
Dynamic programming principle for classical and singular stochastic control with discretionary stopping
Relationship between stochastic maximum principle and dynamic programming principle under convex expectation
![QR code for arXiv:0707.0100 [math.OC]](http://oss.arxitics.com/images/favicon.svg)