Controlled Markov chains

 Access to full text

 Full (PDF)

1. R. Bellman, Dynamic programming, Princeton 1957. (1957) Zbl0995.90618MR0090477
2. R. Bellman S. Dreyfus, Applied dynamic programming, Princeton 1962. (1962) MR0140369
3. W. Feller, An introduction to probability theory and its applications, New York, London 1957. (1957) Zbl0077.12201
4. Ф. P. Гантмахер, Теория матриц, Москва 1966. (1966) Zbl1155.78304
5. T. E. Harris, The theory of branching processes, Berlin, Göttingen, Heidelberg 1963. (1963) Zbl0117.13002MR0163361
6. R. A. Howard, Dynamic programming and Markov processes, New York, London 1960. (1960) Zbl0091.16001MR0118514
7. Kai Lai Chung, Markov chains with stationary transition probabilities, Berlin, Göttingen, Heidelberg 1960. (1960) MR0116388
8. J. G. Kemeny J. L. Snell, Finite Markov chains, Princeton 1960. (1960) MR0115196
9. T. A. Сарымсаков, Основы теории процессов Маркова, Москва 1954. (1954) Zbl0995.90535
10. K. J. Åström, Optimal control of Markov processes with incomplete state information, J. of Math. Analysis and Appl. 10 (1965), 174-204. (1965) MR0173570
11. R. Bellman, A Markovian decision process, J. of Math. and Mech. 6 (1957), 679-684. (1957) Zbl0078.34101MR0091859
12. D. Blackwell, Discrete dynamic programming, AMS 33 (1962), 719-726. (1962) Zbl0133.12906MR0149965
13. D. Blackwell, Memoryless strategies in finite stage dynamic programming, AMS 35 (1964), 863-865. (1964) Zbl0127.36406MR0162642
14. D. Blackwell, Discounted dynamic programming, AMS 36 (1965), 226-235. (1965) Zbl0133.42805MR0173536
15. C. Derman, Stable sequential control rules and Markov chains, J. of Math. Analysis and Appl. 6 (1963), 257-265. (1963) Zbl0129.30703MR0152019
16. C. Derman, Markovian sequential decision processes, Proc. of Symp. on Applied Math. XVI. Providence 1964, 281-289. (1964) Zbl0203.17801MR0184377
17. C. Derman, On sequential control processes, AMS 35 (1964), 341-349. (1964) Zbl0142.14402MR0162684
18. C. Derman, Markovian sequential control processes with denumerable state space, J. of Math. Analysis and Appl. 10 (1965), 295-301. (1965) MR0173588
19. C. Derman, Denumerable state Markovian decision processes. Average cost criterion, AMS 37 (1966), 1545-1553. (1966) Zbl0144.43102MR0207138
20. C. Derman G. J. Lieberman, A Markovian decision model for a joint replacement and stocking problem, Management Sc. 13 (1967), 609-617. (1967) 
21. C. Derman R. E. Strauch, A note on memoryless rules for controlling sequential control processes, AMS 37 (1966), 276-278. (1966) MR0184778
22. E. Б. Дынкин, Упpaвляeмыe cлyчaйныe пocлeдoвaтeльнocти, TBП X (1965), 3-18. (1965) 
23. J. H. Eaton L. A. Zadeh, Optimal pursuit strategies in discrete state probabilistic systems, Transactions of ASME Ser. D, J. of Basic Engineering 84 (1961), 23-29. (1961) MR0153510
24. H. Hatori, On Markov chains with rewards, Kodai math. seminar reports 18 (1966), 184-192. (1966) Zbl0139.34504MR0205325
25. H. Hatori, On continuous-time Markov processes with rewards I, Tamtéž 212-218. Zbl0147.16403
26. H. Hatori T. Mori, On continuous-time Markov processes with rewards II, Tamtéž 353-356. MR0205327
27. R. A. Howard, Research in semi-Markovian decision structures, J. of Operations Res. Soc. of Japan 6 (1964), 163-199. (1964) MR0172699
28. R. A. Howard, System analysis of semi-Markov processes, IEEE Transactions, Milit. Electron. 8 (1964), 114-124. (1964) 
29. R. A. Howard, Dynamic inference, Operations Res. 13 (1965), 712-733. (1965) Zbl0137.39002MR0187358
30. M. Iosifescu P. Mandl, Application des systèmes à liaisons complètes à un problème de réglage, Rev. roum. Math. pures et appl. XI (1966), 533-539. (1966) MR0231461
31. W. S. Jewell, Markov renewal programming I, II, Operations Res. 11 (1963), 938-971. (1963) MR0163374
32. Z. Koutský, O jedné úloze optimálního rozhodování v markovských procesech, Ekon. matem. obzor 1 (1965), 370-382. (1965) 
33. H. B. Крылов, Пocтpoeниe oптимaльнoй cтpaтeгии для кoнeчнoй yпpaвляeмoй цeпи, TBП X (1965), 51-60. (1965) 
34. A. Maitra, Dynamic programming for countable state systems, Sankhyã A 27 (1965), 241-248. (1965) Zbl0171.40805MR0200080
35. P. Mandl, An iterative method for maximizing the characteristic root of positive matrices, Rev. roum. Math. pures et appl. XII (1967), 1305-1310. (1967) Zbl0189.03003MR0238481
36. И. B. Poмaнoвcкий, Cyщecтвoвaниe oптимaльнoгo cтaциoнapнoгo yпpaвлeния в мapкoвcкoм пpoцecce peшeния, TBП X (1965), 130-133. (1965) 
37. B. B. Pыкoв, Упpaвляeмыe мapкoвcкиe пpoцeccы c кoнeчными пpocтpaнcтвaми cocтoяний и yпpaвлeний, TBП XI (1966), 343-351. (1966) 
38. R. E. Strauch, Negative dynamic programming, AMS 37 (1966), 871-890. (1966) Zbl0144.43201MR0194243
39. A. H. Шиpяeв, K тeopии peшaющиx фyҥкций и yпpaвлeнию пpoцeccoм нaблюдeния пo нeпoльным дaнным, Transactions of the Third Prague Conference on Information Theory etc., Prague 1964, 657-682. (1964) 
40. A. H. Шиpяeв, Пocлeдoвaтeльный aнaлиз и yпpaвляeмыe cлyчaйныe пpoцeccы (диcкpeтнoe вpeмя), Kибepнeтикa (1965), 1-24. (1965) 
41. A. H. Шиpяeв, Heкoтopыe нoвыe peзyльтaты в тeopии yпpaвляeмыx cлyчaйныx пpoцeccoв, Transactions of the Fourth Prague Conference on Information Theory etc., Prague 1967, 131-203. (1967) 
42. O. B. Bиcкoв A. H. Шиpяeв, Oб yпpaвлeнияx пpивoдящиx к oптимaльным cтaциoнapным peжимaм, Tpyды мaтeм. инcт. им. B. A. Cтeклoвa LXXI, Mocквa 1964, 35-45. (1964) 
43. P. Wolfe G. B. Dantzig, Linear programming in a Markov chain, Operations Res. 10 (1962), 702-710. (1962) MR0144788

1. Pavla Kunderová, On a mean reward from a Markov replacement process with only one isolated class of recurrent states
2. Pavla Kunderová, On a mean reward from a common Markov replacement process
3. Petr Mandl, Lagrangeovy násobitelé a optimalizace nepřetržitých Markovových řetězců
4. Petr Mandl, Základy optimalizace vícestupňových soustav