Stochastic Convexity in Dynamic Programming

This paper explores sufficient conditions for a continuous stationary Markov optimal policy and a concave value function in stochastic dynamic programming problems. Also, the paper addresses conditions needed for the differentiability of the value function. The paper uses conditions such as first order stochastic dominance, second order stochastic dominance and concave stochastic dominance that are widely applied in economics.