A Unified Approach to an Alternative-Choice Selection Problem
Rémi Dendievel · arXiv (Cornell University) · 2015
The so-called unified approach to stopping problems with an unknown number of options, introduced by Bruss in 1984 and yielding the $1/e$- law of best choice, proves to be efficient also for solving other types of attractive best-choice problem. In this article we show that what we call the alternative-choice stopping problem, instigated by a problem of R. R. Weber, yields the nice lower bound $1/2$ for the probability of success. We also discuss briefly generalizations of this problem.