Previous |  Up |  Next


Markov chains; monotonicity
In this paper we are exploiting some similarities between Markov and Bellman processes and we introduce the main concepts of the paper: comparison of performance measures, and monotonicity of Bellman chains. These concepts are used to establish the main result of this paper dealing with comparison of Bellman chains.
[1] Baccelli F., Cohen G., Olsder G. J., Quadrat J.-P.: Synchronization and Linearity. Wiley, New York 1992 MR 1204266 | Zbl 0824.93003
[2] Bertsekas D. P.: Dynamic Programming. Prentice–Hall, Englewood Cliffs, NJ 1987 MR 0896902
[3] Moral P. Del, Doisy M.: On the applications of Maslov optimization theory. Russian Math. Notes 69 (2001), 2, 232–244 DOI 10.1023/A:1002828503858 | MR 1830225
[4] Keilson J., Kester A.: Monotone matrices and monotone Markov processes. Stochastic Process. Appl. 5 (1977), 231–241 DOI 10.1016/0304-4149(77)90033-3 | MR 0458596 | Zbl 0367.60078
[5] Kijima M.: Markov Processes for Stochastic Modeling. Chapman–Hall, London 1997 MR 1429618 | Zbl 0866.60056
[6] Quadrat J. P., WG, Max-Plus: Min-Plus linearity and statistical mechanics. Markov Processes and Related Fields 3 (1997), 4, 565–597 MR 1607091
Partner of
EuDML logo