Sum the odds to one and stop

DOI10.1214/aop/1019160340zbMath1005.60055OpenAlexW2049808822WikidataQ57309390 ScholiaQ57309390MaRDI QIDQ1854798

F. Thomas Bruss

Publication date: 27 January 2003

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

Full work available at URL: https://doi.org/10.1214/aop/1019160340

zbMATH Keywords

optimal stopping problemsbest-choice problem

Mathematics Subject Classification ID

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

Related Items (38)

Gambling Under Unknown Probabilities as Proxy for Real World Decisions Under Uncertainty ⋮ The Noisy Secretary Problem and Some Results on Extreme Concomitant Variables ⋮ 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 ⋮ Average number of candidates surveyed by the headhunter in the recruitment ⋮ The secretary problem with biased arrival order via a Mallows distribution ⋮ A note on the full-information Poisson arrival selection problem ⋮ What is Known About Robbins' Problem? ⋮ The multi-returning secretary problem ⋮ A general method for finding the optimal threshold in discrete time ⋮ A unified approach for solving sequential selection problems ⋮ Sequential selections with minimization of failure ⋮ Optimal stopping for many connected components in a graph ⋮ 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 ⋮ Stochastic processes with proportional increments and the last-arrival problem ⋮ Unnamed Item ⋮ 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 ⋮ A note on bounds for the odds theorem of optimal stopping. ⋮ Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon ⋮ The monotone case approach for the solution of certain multidimensional optimal stopping problems ⋮ Sum the Multiplicative Odds to One and Stop ⋮ Compare the ratio of symmetric polynomials of odds to one and stop ⋮ Selecting the last consecutive record in a record process ⋮ 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 ⋮ Recognising the last record of sequence ⋮ High-risk and competitive investment models ⋮ Weber's optimal stopping problem and generalizations ⋮ A new method for computing asymptotic results in optimal stopping problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The infinite secretary problem with recall
• Sharp inequalities for optimal stopping with rewards based on ranks
• The infinite secretary problem
• The best-choice secretary problem with random freeze on jobs
• Secretary problems as a source of benchmark bounds
• Extremal processes, secretary problems and the 1/e law

This page was built for publication: Sum the odds to one and stop