Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Optional Stopping Theorem: Proof and Applications

In course

COM-417: Advanced probability and applications

In this course, various aspects of probability theory are considered. The first part covers the main theorems in the field (law of large numbers, central limit theorem), while the second part focuses on the theory of martingales and concentration inequalit ...

Description

This lecture covers the optional stopping theorem for martingales, providing a detailed proof and discussing its implications. The theorem is applied to square-integrable martingales and stopping times, showcasing how it ensures the equality of conditional expectations. The lecture also explores scenarios where the theorem may fail, emphasizing the importance of using proper stopping times to guarantee its validity.

Instructors (2)

Yanina Yurina Shkel

Olivier Lévêque

Olivier Lévêque was born in Switzerland in 1971. He received the physics diploma from EPFL in 1995 and completed his PhD in mathematics at EPFL in 2001. Since then, he has been with the Laboratory of Information Theory at EPFL. He spent the academical year 2005-2006 at the Electrical Engineering Department of Stanford University, where he was appointed as lecturer. His research interests include stochastic analysis, random matrices, wireless communications and information theory.

Official source

Related concepts (31)

Martingale (probability theory)

In probability theory, a martingale is a sequence of random variables (i.e., a stochastic process) for which, at a particular time, the conditional expectation of the next value in the sequence is equal to the present value, regardless of all prior values. Originally, martingale referred to a class of betting strategies that was popular in 18th-century France. The simplest of these strategies was designed for a game in which the gambler wins their stake if a coin comes up heads and loses it if the coin comes up tails.

Stopping time

In probability theory, in particular in the study of stochastic processes, a stopping time (also Markov time, Markov moment, optional stopping time or optional time) is a specific type of “random time”: a random variable whose value is interpreted as the time at which a given stochastic process exhibits a certain behavior of interest. A stopping time is often defined by a stopping rule, a mechanism for deciding whether to continue or stop a process on the basis of the present position and past events, and which will almost always lead to a decision to stop at some finite time.

Optimal stopping

In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance (related to the pricing of American options). A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming.

Doob's martingale convergence theorems

In mathematics specifically, in the theory of stochastic processes Doob's martingale convergence theorems are a collection of results on the limits of supermartingales, named after the American mathematician Joseph L. Doob. Informally, the martingale convergence theorem typically refers to the result that any supermartingale satisfying a certain boundedness condition must converge.

Mathematical proof

A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation".

Related lectures (29)

Martingale Convergence Theorem: Proof and Recap

Covers the proof and recap of the martingale convergence theorem, focusing on the conditions for the existence of a random variable.

Martingale Convergence Theorem: Proof and Stopping Time

Explores the proof of the martingale convergence theorem and the concept of stopping time in square-integrable martingales.

Martingale Convergence Theorem

Covers the proof of the martingale convergence theorem and the convergence of the martingale sequence almost surely.

Basic Properties of Conditional Expectation

Covers basic properties of conditional expectation and Jensen's inequality in probability theory.

Optional Stopping Theorem: Martingales and Stepping Times