Bibliography

(eng): In this note, we consider discrete-time Markov decision processes with finite state space. Recalling explicit formulas for the growth rate of expected value and variance of the cumulative (random) reward, algorithmic procedures for finding optimal policies with respect to various mean variance optimality criteria are discussed. Computational experience with large scale numerical examples is reported.

(cze): V praci se studuji diskretni markovske rozhodovaci procesy s konecnym stavovym prostorem. Vyuzitim explicitnich vztahu pro rychlost rustu ocekavanych hodnot, jakoz i rozptylu kumulativniho (nahodneho) vynosu, jsou navrzeny algorithnmicke postupy pro nalezeni optimalniho rizeni vzhledem k ruznym kriteriim.