@article{KYB_1973_9_2_a4,
author = {Sladk\'y, Karel},
title = {Necessary and sufficient optimality conditions for average reward of controlled {Markov} chains},
journal = {Kybernetika},
pages = {124--137},
year = {1973},
volume = {9},
number = {2},
mrnumber = {0363495},
zbl = {0254.60062},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1973_9_2_a4/}
}
Sladký, Karel. Necessary and sufficient optimality conditions for average reward of controlled Markov chains. Kybernetika, Tome 9 (1973) no. 2, pp. 124-137. http://geodesic.mathdoc.fr/item/KYB_1973_9_2_a4/
[1] Howard R. A.: Dynamic Programming and Markov Processes. M.I.T. and Wiley Press, New York 1960. | MR | Zbl
[2] Denardo E. V., Miller B. L.: An Optimality Condition for Discrete Dynamic Programming with No Discounting. Annals Mathem. Statistics 39 (1968), 4, 1220-1227. | MR | Zbl
[3] Lippman S. A.: On the Set of Optimal Policies in Discrete Dynamic Programming. Journal Mathem. Analysis Applic. 24 (1968), 2, 440-445. | MR | Zbl
[4] Mandl P.: Controlled Markov Chains. (in Czech). Kybernetika 6 (1969), Supplement, 1-74. | MR
[5] Mandl P.: On the Variance in Controlled Markov Chains. Kybernetika 7, (1971), 1, 1-12. | MR | Zbl
[6] Veinott A. F.: On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting. Annals Mathem. Statistics 37 (1966), 5, 1284-1294. | MR | Zbl