A preorder relation for Markov reward processes

DOI10.1016/J.SPL.2007.02.016zbMath1120.60012OpenAlexW2035538300MaRDI QIDQ2643389

David Daly, William H. Sanders, Peter Buchholz

Publication date: 23 August 2007

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2007.02.016

zbMATH Keywords

aggregationstochastic ordersrewardsdiscrete time Markov chainscomparison of Markov processes

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal state-space lumping in Markov chains
• Monotone matrices and monotone Markov processes
• Finite Continuous Time Markov Chains
• Exact and ordinary lumpability in finite Markov chains
• Computing bounds on steady state availability of repairable computer systems
• Stochastically monotone Markov Chains

This page was built for publication: A preorder relation for Markov reward processes