论文信息 - Stochastic convexity in dynamic programming

Stochastic convexity in dynamic programming

Summary. 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.

Alp E. Atakan

[1] Nancy L. Stokey,et al. Recursive methods in economic dynamics , 1989 .

[2] N. Furukawa. Markovian Decision Processes with Compact Action Spaces , 1972 .

[3] Prajit K. Dutta,et al. Parametric continuity in dynamic programming problems , 1994 .

[4] Moshe Shaked,et al. Stochastic orders and their applications , 1994 .

[5] R. Grafton,et al. Saving the seas: The economic justification for marine reserves , 2004 .

[6] Gerald B. Folland,et al. Real Analysis: Modern Techniques and Their Applications , 1984 .

[7] J. Scheinkman,et al. On the Differentiability of the Value Function in Dynamic Models of Economics , 1979 .

[8] Kenneth Burdett,et al. Search, Layoffs, and Labor Market Equilibrium , 1980, Journal of Political Economy.

[9] D. Blackwell. Discounted Dynamic Programming , 1965 .

[10] R. Amir. A new look at optimal growth under uncertainty , 1997 .

[11] M. Rothschild,et al. Increasing risk II: Its economic consequences , 1971 .

[12] M. Rothschild,et al. Increasing risk: I. A definition , 1970 .

[13] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.