Towards a more robust treatment of discrete-time stochastic processes: developing a theoretical framework for working with imprecise probabilities in Markov chains

We aim to develop a theoretical framework, and efficient algorithms, for imprecise discrete-time Markov chains. The imprecision relates to the parameters of the model, which need not be specified exactly. This leads to more robust and reliable results. The motivation stems from the popularity of
traditional Markov chains, and from society’s increasing demand for features such as robustness and reliability.