Optional stopping theorem

From HandWiki
Short description: Theorem in probability theory

In probability theory, the optional stopping theorem (or sometimes Doob's optional sampling theorem, for American probabilist Joseph Doob[1]) says that, under certain conditions, the expected value of a martingale at a stopping time is equal to its initial expected value.[2]

The concept can be understood through the following key principles:

  • Since martingales can be used to model the wealth of a gambler participating in a fair game, the optional stopping theorem implies that, on average, nothing can be gained by stopping play based on the information obtainable so far (i.e., without looking into the future).
  • Certain conditions are necessary for this result to hold true. In particular, the theorem applies to doubling strategies and illustrates mathematically why such strategies cannot guarantee a profit with finite resources.[3]
  • The optional stopping theorem is an important tool of mathematical finance in the context of the fundamental theorem of asset pricing, helping to evaluate the expected returns of various pricing models.

Statement

A discrete-time version of the theorem is given below, with 0 denoting the set of natural numbers, including zero.

Let X=(Xt)t0 be a discrete-time martingale and τ a stopping time with values in 0{}, both with respect to a filtration (t)t0. Assume that one of the following three conditions holds:

(a) The stopping time τ is almost surely bounded, i.e., there exists a constant c such that τc almost surely.
(b) The stopping time τ has finite expectation and the conditional expectations of the absolute value of the martingale increments are almost surely bounded. More precisely, 𝔼[τ]< and there exists a constant c such that 𝔼[|Xt+1Xt||t]c almost surely on the event {τ>t} for all t0.
(c) There exists a constant c such that |Xmin{t,τ}|c almost surely for all t0.

Then Xτ is an almost surely well-defined random variable and 𝔼[Xτ]=𝔼[X0].[4]

Similarly, if the stochastic process X=(Xt)t0 is a submartingale or a supermartingale and one of the above conditions holds, then: 𝔼[Xτ]𝔼[X0] for a submartingale, and 𝔼[Xτ]𝔼[X0] for a supermartingale.

Remark

Under condition (c) it is possible that τ= happens with positive probability. On this event, Xτ is defined as the almost surely existing pointwise limit of X=(Xt)t0. See the proof below for details.

Applications

The optional stopping theorem has widespread applications in probability, paradox resolution, and random walk theory:[5]

  • Impossibility of perfect betting strategies: The theorem can be used to prove the impossibility of successful betting strategies for a gambler with a finite lifetime (giving condition (a)) or a house limit on bets (condition (b)).
    • Suppose that the gambler can wager up to c dollars on a fair coin flip at times 1, 2, 3, etc., winning their wager if the coin comes up heads and losing it if the coin comes up tails.
    • Suppose further that the gambler can quit whenever they like, but cannot predict the outcome of gambles that have not happened yet.
    • The gambler's fortune over time is a martingale, and the time τ at which they decide to quit (or go broke and are forced to quit) is a stopping time. So the theorem says that 𝔼[Xτ]=𝔼[X0]. In other words, the gambler leaves with the same amount of money on average as when they started.
    • The same result holds if the gambler has a finite limit on their line of credit or how far in debt they may go, rather than a house limit on individual bets.
  • Expected stop position of a random walk: Suppose a random walk starting at a0 goes up or down by one with equal probability on each step.
    • Suppose further that the walk stops if it reaches 0 or ma; the time at which this first occurs is a stopping time.
    • If it is known that the expected time at which the walk ends is finite (e.g., from Markov chain theory), the optional stopping theorem predicts that the expected stop position is equal to the initial position a.
    • Solving a=pm+(1p)0 for the probability p that the walk reaches m before 0 gives p=a/m.
  • Expected time of a random walk: Consider a random walk X that starts at 0 and stops if it reaches m or +m, and use the Yn=Xn2n martingale from Martingale (probability theory) § Examples of martingales. If τ is the time at which X first reaches ±m, then 0=𝔼[Y0]=𝔼[Yτ]=m2𝔼[τ]. This directly gives 𝔼[τ]=m2.
  • Violations of the theorem (Counterexamples): Care must be taken to ensure that one of the conditions of the theorem holds.
    • For example, suppose the last example had instead used a 'one-sided' stopping time, so that stopping only occurred at +m, not at m.
    • The value of X at this stopping time would therefore be m, meaning the expectation value 𝔼[Xτ] must also be m.
    • This seemingly violates the theorem which would give 𝔼[Xτ]=X0=0. The failure of the optional stopping theorem in this case shows that all three of the conditions fail for a one-sided stopping time with an unrestricted state space.

Proof

Let Xτ denote the stopped process, which is also a martingale (or a submartingale or supermartingale, respectively). The framework of the proof relies on analyzing this process under the provided conditions:

  • Under condition (a) or (b), the random variable Xτ is well defined.
  • Under condition (c) the stopped process Xτ is bounded, hence by Doob's martingale convergence theorem it converges almost surely pointwise to a random variable which we call Xτ.

If condition (c) holds, then the stopped process Xτ is bounded by the constant random variable M:=c. Otherwise, writing the stopped process as Xtτ=X0+s=0τ1t1(Xs+1Xs),t0 gives XtτM for all t0, where M:=|X0|+s=0τ1|Xs+1Xs|=|X0|+s=0|Xs+1Xs|𝟏{τ>s}.

By the monotone convergence theorem, 𝔼[M]=𝔼[|X0|]+s=0𝔼[|Xs+1Xs|𝟏{τ>s}].

If condition (a) holds, then this series only has a finite number of non-zero terms, hence M is integrable.

If condition (b) holds, then we continue by inserting a conditional expectation and using that the event {τ>s} is known at time s (note that τ is assumed to be a stopping time with respect to the filtration). This yields: 𝔼[M]=𝔼[|X0|]+s=0𝔼[𝔼[|Xs+1Xs||s]𝟏{τ>s}c𝟏{τ>s} a.s. by (b)]𝔼[|X0|]+cs=0(τ>s)=𝔼[|X0|]+c𝔼[τ]<, where a representation of the expected value of non-negative integer-valued random variables is used for the last equality.

Therefore, under any one of the three conditions in the theorem, the stopped process is dominated by an integrable random variable M. Since the stopped process Xτ converges almost surely to Xτ, the dominated convergence theorem implies: 𝔼[Xτ]=limt𝔼[Xtτ].

By the martingale property of the stopped process, 𝔼[Xtτ]=𝔼[X0],t0, hence 𝔼[Xτ]=𝔼[X0].

Similarly, if X is a submartingale or supermartingale, respectively, change the equality in the last two formulas to the appropriate inequality.

References

  1. Doob, J. L. (1953). Stochastic Processes. New York: John Wiley & Sons. ISBN 978-0-471-21813-5. 
  2. Williams, David (1991). Probability with Martingales. Cambridge University Press. pp. 99–106. ISBN 978-0521406055. 
  3. Durrett, Rick (2019). Probability: Theory and Examples (5th ed.). Cambridge University Press. pp. 240–245. ISBN 978-1108473682. 
  4. Bhattacharya, Rabi; Waymire, Edward C. (2007). A Basic Course in Probability Theory. Springer. pp. 43–45. ISBN 978-0-387-71939-9. https://books.google.com/books?id=clQQVdUNBmcC&q=%22Optional+stopping%22. 
  5. Grimmett, Geoffrey R.; Stirzaker, David R. (2001). Probability and Random Processes (3rd ed.). Oxford University Press. pp. 491–495. ISBN 9780198572220. https://archive.org/details/probabilityrando00grgr.