We consider several classes of control problems for Markov processes (continuous control, optimal stopping, impulse control). The formulation we use is valid for general Markov semigroups. We study the discrete time approximation of the dynamic programming equation, using mainly an analytical approach. Probabilistic interpretation is given for some of the results.
No takes yet. Share an insight, caveat, or question.
Bensoussan et al. (1982) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: