Geodesic
On the existence of stationary optimal policies in discrete dynamic programming
Kybernetika, Tome 17 (1981) no. 6, pp. 489-513 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 90C39, 90C40 
@article{KYB_1981_17_6_a2,
     author = {Sladk\'y, Karel},
     title = {On the existence of stationary optimal policies in discrete dynamic programming},
     journal = {Kybernetika},
     pages = {489--513},
     year = {1981},
     volume = {17},
     number = {6},
     mrnumber = {674064},
     zbl = {0473.90086},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1981_17_6_a2/}
}
TY  - JOUR
AU  - Sladký, Karel
TI  - On the existence of stationary optimal policies in discrete dynamic programming
JO  - Kybernetika
PY  - 1981
SP  - 489
EP  - 513
VL  - 17
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/KYB_1981_17_6_a2/
LA  - en
ID  - KYB_1981_17_6_a2
ER  - 
%0 Journal Article
%A Sladký, Karel
%T On the existence of stationary optimal policies in discrete dynamic programming
%J Kybernetika
%D 1981
%P 489-513
%V 17
%N 6
%U http://geodesic.mathdoc.fr/item/KYB_1981_17_6_a2/
%G en
%F KYB_1981_17_6_a2
Sladký, Karel. On the existence of stationary optimal policies in discrete dynamic programming. Kybernetika, Tome 17 (1981) no. 6, pp. 489-513. http://geodesic.mathdoc.fr/item/KYB_1981_17_6_a2/

[1] F. R. Gantmakher: Teoriya matric. Second edition, Nauka, Moskva 1966.

[2] J. Flynn: Conditions for equivalence of optimality criteria in dynamic programming. Ann. Statist. 4 (1976), 5, 936-953. | MR

[3] A. Hordijk K. Sladký: Sensitive optimality criteria in countable state dynamic programming. Mathem. Oper. Res. 2 (1977), 1, 1-14. | MR

[4] R. A. Howard J. E. Matheson: Risk-sensitive Markov decision processes. Manag. Sci. 75 (1972), 7, 357-369. | MR

[5] P. Mandl: Controlled Markov chains. (in Czech). Kybernetika 6 (1969), Supplement, 1 - 74. | MR

[6] U. G. Rothblum: Multiplicative Markov Decision Chains. PhD Dissertation, Dept. Oper. Res., Stanford U., Stanford, Calif. 1974. | MR

[7] K. Sladký: On the set of optimal controls for Markov chains with rewards. Kybernetika 70 (1974), 4, 350-367. | MR

[8] K. Sladký: Bounds on discrete dynamic programming recursions 1 - Models with non-negative matrices. Kybernetika 16 (1980), 6, 526-547. | MR

[9] K. Sladký: Bounds on discrete dynamic programming recursions II - Polynomial bounds on problems with block-triangular structure. Kybernetika 77(1981), 4, 310-328. | MR

[10] A. F. Veinott, Jr.: Discrete dynamic programming with sensitive optimality criteria. (preliminary report). Ann. Math. Statist. 39 (1968), 4, 1372.

[11] A. F. Veinott, Jr.: Discrete dynamic programming with sensitive discount optimality criteria. Ann. Math. Statist. 40 (1969), 5, 1635-1660. | MR | Zbl