Skip to main content

Dynamic Programming and Markov Decision Processes

  • Reference work entry
  • First Online:
The New Palgrave Dictionary of Economics
  • 75 Accesses

Abstract

A great many problems in economics can be reduced to determining the maximum of a given function. Dynamic programming is one of a number of mathematical optimization techniques applicable in such problems. As will be illustrated, the dynamic programming technique or viewpoint is particularly useful in complex optimization problems with many variables in which time plays a crucial role. Unlike calculus-based techniques it does not require the function being optimized to be differentiable in the (decision) variables.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 6,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 8,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Bibliography

  • Bellman, R. 1957. Dynamic programming. Princeton: Princeton University Press.

    Google Scholar 

  • Blackwell, D. 1962. Discrete dynamic programming. Annals of Mathematics and Statistics 33: 719–726.

    Article  Google Scholar 

  • Blackwell, D. 1965. Discounted dynamic programming. Annals of Mathematics and Statistics 36: 226–235.

    Article  Google Scholar 

  • Denardo, E.V. 1967. Contraction mappings in the theory underlying dynamic programming. SIAM Review 9: 165–177.

    Article  Google Scholar 

  • Denardo, E.V. 1982. Dynamic programming. Englewood Cliffs: Prentice-Hall.

    Google Scholar 

  • Hakansson, N.H. 1970. Optimal investment and consumption strategies under risk for a class of utility functions. Econometrica 38: 587–607.

    Article  Google Scholar 

  • Heyman, D., and M. Sobel. 1984. Stochastic models in operations research, vol. II. New York: McGraw-Hill.

    Google Scholar 

  • Howard, R.A. 1960. Dynamic programming and Markov processes. Cambridge, MA: MIT Press.

    Google Scholar 

  • Levhari, D., and L.J. Mirman. 1977. Savings and uncertainty with an uncertain horizon. Journal of Political Economy 85: 265–281.

    Article  Google Scholar 

  • Lippman, S. 1975. On dynamic programming with unbounded rewards. Management Science 21: 1225–1233.

    Article  Google Scholar 

  • Miller, B.L. 1974. Optimal consumption with a stochastic income stream. Econometrica 42: 253–266.

    Article  Google Scholar 

  • Miller, B.L. 1976. The effect on optimal consumption of increased uncertainty in labor income in the multi period case. Journal of Economic Theory 13: 154–167.

    Article  Google Scholar 

  • Mirman, L.J. 1971. Uncertainty and optimal consumption decisions. Econometrica 39: 179–185.

    Article  Google Scholar 

  • Phelps, E.S. 1962. The accumulation of risky capital: A sequential utility analysis. Econometrica 30: 729–743.

    Article  Google Scholar 

  • Ross, S. 1983. Introduction to stochastic dynamic programming. New York: Academic Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Copyright information

© 2018 Macmillan Publishers Ltd.

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Lippman, S.A. (2018). Dynamic Programming and Markov Decision Processes. In: The New Palgrave Dictionary of Economics. Palgrave Macmillan, London. https://doi.org/10.1057/978-1-349-95189-5_80

Download citation

Publish with us

Policies and ethics