The existence of admissible strategies γ ( · , · ) minimizing a function E∫₀¹ c(t,x,γ (t,x))dt is studied, with x = x( · ,ω ) a continuous stochastic process, and admissible strategies defined as those utilizing a specified pattern of information about x, here described by σ-algebras Gₜ included in the “past” \ x(s),s t \. Conclusion: Moment conditions on x, growth conditions on c, and continuity of c in its third variable (the control) ensure that an optimal admissible strategy exists. The method of proof depends on properties of conditional expectations, and on a variant of a general Filippov (or implicit functions) lemma due to McShane and Warfield.
No takes yet. Share an insight, caveat, or question.
Vladimír Beneš (1970) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: