A note on bounds for the odds theorem of optimal stopping
Author:
- F. Thomas BrussFBF. Thomas Bruss
Open Access
- 1 October 2003
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Probability
- Vol. 31 (4) , 1859-1961
Abstract
The odds theorem gives a unified answer to a class of stopping problems on sequences of independent indicator functions. The success probability of the optimal rule is known to be larger than $Re^{-R}$, where R defined in the theorem satisfies $R\ge 1$ in the more interesting case. The following findings strengthen this result by showing that $1/e$ is then a lower bound. Knowing that this is the best possible uniform lower bound motivates this addendum.
Keywords
This publication has 4 references indexed in Scilit:
- Optimal stopping on trajectories and the ballot problemJournal of Applied Probability, 2001
- Sum the odds to one and stopThe Annals of Probability, 2000
- Secretary problems as a source of benchmark bounds1992
- A prophet inequality related to the secretary problem1992