Dynamic Programming via Measurable Selection

Roy Cerqueti

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)169-181
JournalPacific Journal of Optimization
Publication statusPublished - 1 Apr 2009
Externally publishedYes

Keywords

  • Exit Time
  • Stochastic Optimal Control
  • Measurable Selection
  • Dynamic Programming

Fingerprint

Dive into the research topics of 'Dynamic Programming via Measurable Selection'. Together they form a unique fingerprint.

Cite this