Oscillation criteria for stopping near the top of a random walk
Abstract
Consider the problem of maximizing the probability of stopping with one of the two highest values in a Bernoulli random walk with arbitrary parameter p and finite time horizon n. Allaart Allaart proved that the optimal strategy is determined by an interesting sequence of constants \pn\. He conjectured the asymptotic behavior to be 1/2. In this work the best lower bound for this sequence is found and more of its properties are proven towards solving the conjecture.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.