# Stopping time

Let $\mathcal{F}_t$, $t\in T$, be a non-decreasing family of sub-$\sigma$-algebras on a measurable space $(\Omega,\mathcal{F})$, where $T$ is an interval in $[0,\infty]$ or a subset of $\{0,1,2,\ldots,\infty\}$. Then a stopping time (relative to this family of subalgebras) is a mapping (a random variable) $\tau : \Omega \rightarrow T \cup \{\infty\}$ such that $$ \{\tau(\omega) \le t\} \in \mathcal{F}_t $$ for all $t\in T$. Such a random variable is also called an optional random variable. This condition has the interpretation that the (time-valued) random variable $\tau$ has no knowledge of the future, since the $\sigma$-algebra $\mathcal{F}_t$ embodies "random events up to time $t$" . Many stopping times arise as "the point of time at which a given random event is observed for the first time" ; for instance, the first time of entry of a stochastic process $X(t)$ into a set $A$ (hitting time). In the (translated) Russian literature the phrase Markov moment, or Markov time, is often used for stopping time. Occasionally one also finds the phrase non-anticipating time. Stopping times naturally arise, e.g., in optimal stopping problems, cf., e.g., [a4].

#### References

[a1] | H. Bauer, "Probability theory and elements of measure theory" , Holt, Rinehart & Winston (1972) pp. 332 (Translated from German) |

[a2] | J. Lamperti, "Stochastic processes" , Springer (1977) pp. 210–213 |

[a3] | K.L. Chung, "Elementary probability theory with stochastic processes" , Springer (1974) pp. 269 |

[a4] | I.I. [I.I. Gikhman] Gihman, A.V. [A.V. Skorokhod] Skorohod, "Controlled stochastic processes" , Springer (1979) (Translated from Russian) |

[a5] | M.M. Rao, "Stochastic processes and integration" , Sijthoff & Noordhoff (1979) |

**How to Cite This Entry:**

Stopping time.

*Encyclopedia of Mathematics.*URL: http://www.encyclopediaofmath.org/index.php?title=Stopping_time&oldid=42047