Bounds for the Success Probability in the Odds Theorem
Abstract
Bruss's odds theorem Bruss1 addresses the problem of determining the optimal stopping time for sequences of independent indicator functions. In this note, we derive upper and lower bounds for the success probability under the optimal stopping rule. These bounds depend on the number of independent events under consideration and on a deterministic index specifying the stopping time. Moreover, the bounds are sharp: we provide explicit examples in which the corresponding inequalities are attained with equality.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.