Skip to main content

Risk-Sensitive Average Optimality in Markov Decision Chains

  • Conference paper
Operations Research Proceedings 2007

Part of the book series: Operations Research Proceedings ((ORP,volume 2007))

  • 1746 Accesses

Abstract

We consider a Markov decision chain X = {X n, n = 0, 1, ...} with finite state space \( \mathcal{I} \) = {1, 2, ...,N} and a finite set \( \mathcal{A}_i \) = {1, 2, ...,K i} of possible decisions (actions) in state i\( \mathcal{I} \). Supposing that in state i\( \mathcal{I} \) action k\( \mathcal{A}_i \) is selected, then state j is reached in the next transition with a given probability p kij and one-stage transition reward r ij will be accrued to such transition.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berman A and Plemmons RJ (1979) Nonnegative Matrices in the Mathematical Sciences. Academic Press, New York

    Google Scholar 

  2. Cavazos-Cadena R, Montes-de-Oca R (2003) The value iteration algorithm in risk-sensitive average Markov decision chains with finite state space. Math Oper Res 28:752–756

    Article  Google Scholar 

  3. Gantmakher FR (1959) The Theory of Matrices. Chelsea, London

    Google Scholar 

  4. Howard RA, Matheson J (1972) Risk-sensitive Markov decision processes. Manag Sci 23:356–369

    Article  Google Scholar 

  5. Sladký K (1976) On dynamic programming recursions for multiplicative Markov decision chains. Math Programming Study 6:216–226

    Google Scholar 

  6. Sladký K (1980) Bounds on discrete dynamic programming recursions I. Kybernetika 16:526–547

    Google Scholar 

  7. Whittle P (1983) Optimization Over Time — Dynamic Programming and Stochastic Control. Volume II, Chapter 35, Wiley, Chichester

    Google Scholar 

  8. Zijm WHM (1983) Nonnegative Matrices in Dynamic Programming. Mathematical Centre Tract, Amsterdam

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sladký, K., Montes-de-Oca, R. (2008). Risk-Sensitive Average Optimality in Markov Decision Chains. In: Kalcsics, J., Nickel, S. (eds) Operations Research Proceedings 2007. Operations Research Proceedings, vol 2007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77903-2_11

Download citation

Publish with us

Policies and ethics