We consider the optimal stopping problem for a discrete-time Markov process on a Borel state space . It is supposed that an unknown transition probability , , is approximated by the transition probability , , and the stopping rule , optimal for , is applied to the process governed by . We found an upper bound for the difference between the total expected cost, resulting when applying , and the minimal total expected cost. The bound given is a constant times , where is the total variation...
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 . It is supposed that the transition probability , is approximated by the transition probability , , and that the stopping rule , which is optimal for the process with the transition probability is applied to the process with the transition probability . We give an upper bound (expressed in term of the total variation distance: for...
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 study the stability of the classical optimal sequential probability ratio test based on independent identically distributed observations when testing two simple hypotheses about their common density : versus . As a functional to be minimized, it is used a weighted sum of the average (under ) sample number and the two types error probabilities. We prove that the problem is reduced to stopping time optimization for a ratio process generated by with the density . For being the corresponding...
Download Results (CSV)