Skip to main content
SpringerLink
Log in

Controllable semi-Markovian chains

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. R. A. Howard, Dynamic Programming and Markovian Processes, MIT Press, Cambridge, Massachusetts (1960).

    Google Scholar 

  2. D. Blackwell, “Discrete dynamic programming,” Ann. Math. Statist.,32, No. 2 (1962).

    Google Scholar 

  3. C. Derman, Finite State Markovian Decision Processes, Academic Press, New York — London (1970).

    Google Scholar 

  4. S. Osaki and H. Mine, “Linear programming considerations on Markovian decision processes with no discounting,” J. Math. Anal. Appl.,26, No. 1 (1969).

    Google Scholar 

  5. E. V. Denardo, “Markov renewal programs with small interest raters,” Ann. Math. Statist.42, No. 2 (1972).

    Google Scholar 

  6. E. V. Denardo, “Separable Markovian decision problem,” Management Science,14, No. 7 (1968).

Download references

Authors
  1. L. I. Gikhman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 107–112, January–February, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gikhman, L.I. Controllable semi-Markovian chains. Cybern Syst Anal 10, 134–141 (1974). https://doi.org/10.1007/BF01069030

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01069030

Keywords

Search

Navigation