New developments of the odds theorem
read the original abstract
The odds theorem and the corresponding solution algorithm (odds algorithm) are tools to solve a wide range of optimal stopping problems. Its generality and tractability have caught much attention. (Google for instance "Bruss odds" to obtain a quick overview.) Many extensions and modifications of the this result have appeared since publication in~2000. This article reviews the important gnew developments and applications in this field. The spectrum of application comprises as different fields as secretary problems, more general stopping problems, robotic maintenance problems, compassionate use clinical trials and others. This review also includes a new contribution of our own.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Stopping on the last success with unknown odds: Impossibility barriers and quantitative oracle bounds
The plug-in empirical rule for the last-success problem achieves asymptotic oracle optimality when p_n -> 0 with n p_n -> infinity and finite-horizon bounds for p >= p0 > 0, but no oracle-free rule converges uniformly...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.