Sum the odds to one and stop
From MaRDI portal
Publication:1854798
DOI10.1214/aop/1019160340zbMath1005.60055WikidataQ57309390 ScholiaQ57309390MaRDI QIDQ1854798
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
60G40: Stopping times; optimal stopping problems; gambling theory
Related Items
Compare the ratio of symmetric polynomials of odds to one and stop, A note on the full-information Poisson arrival selection problem, Sum the Multiplicative Odds to One and Stop, A note on last-success-problem, The Secretary Problem—An Update, Average number of candidates surveyed by the headhunter in the recruitment, A general method for finding the optimal threshold in discrete time, Dokładna i asymptotyczna analiza rozwiązań optymalnych problemów zatrzymania Brussa i Webera, Odds -theorem and monotonicity, What is Known About Robbins' Problem?, Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon, Where should you park your car? The $\frac{1}{2}$ rule, Gambling Under Unknown Probabilities as Proxy for Real World Decisions Under Uncertainty, Optimal stopping for many connected components in a graph, Stochastic processes with proportional increments and the last-arrival problem, No-information secretary problems with cardinal payoffs and Poisson arrivals, A note on bounds for the odds theorem of optimal stopping., High-risk and competitive investment models, The monotone case approach for the solution of certain multidimensional optimal stopping problems, A new method for computing asymptotic results in optimal stopping problems, The secretary problem with biased arrival order via a Mallows distribution, The multi-returning secretary problem, A unified approach for solving sequential selection problems, A turn-based game related to the last-success-problem, An extension of the last-success-problem, Weber's optimal stopping problem and generalizations, The best-or-worst and the postdoc problems with random number of candidates, Sequential selections with minimization of failure, Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings, A sharp lower bound for choosing the maximum of an independent sequence, Selecting the last consecutive record in a record process, Odds Theorem with Multiple Selection Chances, 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, Recognising the last record of sequence, Odds-based decision-making tool for opportunistic production-maintenance synchronization, The odds algorithm based on sequential updating and its performance
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
