IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-031-40180-0_1.html
   My bibliography  Save this book chapter

Discrete Markov Processes and Numerical Algorithms for Markov Chains

In: Markov Decision Processes and Stochastic Positional Games

Author

Listed:
  • Dmitrii Lozovanu

    (Moldowa Academy of Science)

  • Stefan Wolfgang Pickl

    (Universität der Bundeswehr München)

Abstract

This chapter states the necessary classical results on discrete-time Markov processes and presents some approaches for determining the basic probabilistic characteristics of finite state space Markov chains. The main focus is on the elaboration of efficient numerical algorithms for computing the state-time probabilities, the limiting and differential matrices, as well as the average and expected total discounted rewards for discrete-time Markov processes. New algorithms for determining the limiting and differential matrices for such processes based on the z-transform are developed, and innovative procedures for calculating the state-time probabilities based on dynamic programming are substantiated.

Suggested Citation

  • Dmitrii Lozovanu & Stefan Wolfgang Pickl, 2024. "Discrete Markov Processes and Numerical Algorithms for Markov Chains," International Series in Operations Research & Management Science, in: Markov Decision Processes and Stochastic Positional Games, chapter 0, pages 1-124, Springer.
    • Handle: RePEc:spr:isochp:978-3-031-40180-0_1
    DOI: 10.1007/978-3-031-40180-0_1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-3-031-40180-0_1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.