We offer the quantitative estimation of stability of risk-sensitive cost optimization in the problem of optimal stopping of Markov chain on a Borel space X. It is supposed that the transition probability p(⋅|x), x∈X is approximated by the transition probability p˜(⋅|x), x∈X, and that the stopping rule f˜∗ , which is optimal for the process with the transition probability p˜ is applied to the process with the transition probability p. We give an upper bound (expressed in term of the total variation distance: supx∈X∥p(⋅|x)−p˜(⋅|x)∥) for an additional cost paid for using the rule f˜∗ instead of the (unknown) stopping rule f∗ optimal for p.
We study the stability of average optimal control of general discrete-time Markov processes. Under certain ergodicity and Lipschitz conditions the stability index is bounded by a constant times the Prokhorov distance between distributions of random vectors determinating the "original and the perturbated" control processes.
We consider the optimal stopping problem for a discrete-time Markov process on a Borel state space X. It is supposed that an unknown transition probability p(⋅|x), x∈X, is approximated by the transition probability p˜(⋅|x), x∈X, and the stopping rule τ˜∗, optimal for p˜, is applied to the process governed by p. We found an upper bound for the difference between the total expected cost, resulting when applying \wtτ∗, and the minimal total expected cost. The bound given is a constant times \dpssupx∈X∥p(⋅|x)−\wtp(⋅|x)∥, where ∥⋅∥is the total variation norm.