Skip to main content

Markovian Decision Processes with Discrete Transition Law

  • Chapter
  • First Online:
Dynamic Optimization

Part of the book series: Universitext ((UTX))

  • 3051 Accesses

Abstract

We consider MDPs with countable state spaces and variable discount factors. The discount factor may depend on the state and the action. Under minimal assumptions we prove the reward iteration and formulate a structure theorem for MDPs. Also the useful notion of a bounding function is introduced.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  • Hinderer, K. (1971). Instationäre dynamische Optimierung bei schwachen Voraussetzungen über die Gewinnfunktionen. Abhandlungen aus dem Mathematischen Seminar University of Hamburg, 36, 208–223.

    Article  MATH  Google Scholar 

  • Hinderer, K. (1977). Does the value iteration for finite-stage discrete dynamic programs hold “always”? In Dynamische optimierung (pp. 41–56). Bonner Math. Schriften, No. 98.

    Google Scholar 

  • Lippman, S. A. (1974/1975). On dynamic programming with unbounded rewards. Management Science, 21, 1225–1233.

    Article  MathSciNet  MATH  Google Scholar 

  • Rieder, U. (1975b). On stopped decision processes with discrete time parameter. Stochastic Processes Application, 3, 365–383.

    Article  MathSciNet  MATH  Google Scholar 

  • Veinott, Jr., A. F. (1969). Discrete dynamic programming with sensitive discount optimality criteria. The Annals of Mathematical Statistics, 40, 1635–1660.

    Article  MathSciNet  MATH  Google Scholar 

  • Wessels, J. (1977). Stopping times and Markov programming. In Transactions of the seventh Prague conference on information theory, statistical decision functions, random P (pp. 575–585). Dordrecht: Reidel.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this chapter

Cite this chapter

Hinderer, K., Rieder, U., Stieglitz, M. (2016). Markovian Decision Processes with Discrete Transition Law. In: Dynamic Optimization. Universitext. Springer, Cham. https://doi.org/10.1007/978-3-319-48814-1_14

Download citation

Publish with us

Policies and ethics