A note on bounds for the odds theorem of optimal stopping.

DOI10.1214/aop/1068646368zbMath1059.60056OpenAlexW2136519165WikidataQ57309391 ScholiaQ57309391MaRDI QIDQ1433881

F. Thomas Bruss

Publication date: 1 July 2004

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.aop/1068646368

zbMATH Keywords

secretary probleminvestment problemsuniform lower boundgroup interviewsOdds algorithm

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (18)

Maximizing the probability of stopping on any of the last m successes in independent Bernoulli trials with random horizon ⋮ The Secretary Problem—An Update ⋮ No-information secretary problems with cardinal payoffs and Poisson arrivals ⋮ A sharp lower bound for choosing the maximum of an independent sequence ⋮ The best-or-worst and the postdoc problems with random number of candidates ⋮ Dokładna i asymptotyczna analiza rozwiązań optymalnych problemów zatrzymania Brussa i Webera ⋮ Odds -theorem and monotonicity ⋮ A turn-based game related to the last-success-problem ⋮ Odds-based decision-making tool for opportunistic production-maintenance synchronization ⋮ Sum the Multiplicative Odds to One and Stop ⋮ Compare the ratio of symmetric polynomials of odds to one and stop ⋮ Odds Theorem with Multiple Selection Chances ⋮ An extension of the last-success-problem ⋮ Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings ⋮ The odds algorithm based on sequential updating and its performance ⋮ A note on last-success-problem ⋮ Where should you park your car? The $\frac{1}{2}$ rule ⋮ Weber's optimal stopping problem and generalizations

Cites Work

• Unnamed Item
• Unnamed Item
• Secretary problems as a source of benchmark bounds
• Sum the odds to one and stop
• Optimal stopping on trajectories and the ballot problem

This page was built for publication: A note on bounds for the odds theorem of optimal stopping.