| Abstract: | In the Bayes sequential change-point problem, an assumption of a fully known prior distribution of a change-point is usually impracticable. At every moment, one often knows only the discrete hazard function, that is, the probability of a change occurring before the next observation is collected, given that it has not occurred so far. In the randomized model, the observed or predicted values of the hazard function are assumed to form a Markov chain. Under these assumptions, the optimal change-point detection stopping rules are derived for two popular loss functions introduced in Shiryaev (1978) and Ritov (1990). Derivations are based on the theory of optimal stopping of Markov sequences. |
