Dynamic Programming via Measurable Selection
Roy Cerqueti · Research Open (London South Bank University) · 2009
The aim of this paper is to provide the proof of a Dynamic Programming Principle for a certain class of stochastic control problems with exit time. To this end, a Measurable Selection Theorem is also proved.