The Best Choice Problem for a Random Number of Objects

DOI10.1137/1117078zbMath0296.60031OpenAlexW1975650960MaRDI QIDQ4049864

Isaac M. Sonin, Ernst L. Presman

Publication date: 1972

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1117078

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Related Items (34)

When to stop -- a cardinal secretary search experiment ⋮ The full-information best choice problem with a random number of observations ⋮ Maximizing the probability of stopping on any of the last m successes in independent Bernoulli trials with random horizon ⋮ The best-choice secretary problem with random freeze on jobs ⋮ No-information secretary problems with cardinal payoffs and Poisson arrivals ⋮ The 1/e-strategy is sub-optimal for the problem of best choice under no information ⋮ Continue, quit, restart probability model ⋮ Why do these quite different best-choice problems have the same solutions? ⋮ An application of prophet regions to optimal stopping with a random number of observations ⋮ What is Known About Robbins' Problem? ⋮ Invariant record processes and applications to best choice modelling ⋮ Maximizing the Expected Duration of Owning a Relatively Best Object in a Poisson Process with Rankable Observations ⋮ Choosing either the best or the second best when the number of applicants is random ⋮ A unified approach for solving sequential selection problems ⋮ The best choice problem with an unknown number of objects ⋮ The best-or-worst and the postdoc problems with random number of candidates ⋮ Shelf life of candidates in the generalized secretary problem ⋮ Generalized Sequential Stochastic Assignment Problem ⋮ Fuzzy stopping problems in continuous-time fuzzy stochastic systems ⋮ Selection of nonextremal candidates from a random sequence ⋮ Odds -theorem and monotonicity ⋮ On a duration problem with unbounded geometrical horizon ⋮ Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon ⋮ A secretary problem with restricted offering chances and random number of applications ⋮ An interactive method for the optimal selection problem with two decision makers ⋮ Sum the Multiplicative Odds to One and Stop ⋮ On the best choice problem with random population size ⋮ An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object ⋮ The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy ⋮ Unnamed Item ⋮ Optimal stopping problems in a stochastic and fuzzy system ⋮ Optimal stopping models in a stochastic and fuzzy environment ⋮ A new method for computing asymptotic results in optimal stopping problems ⋮ Progressive stopping heuristics that excel in individual and competitive sequential search

This page was built for publication: The Best Choice Problem for a Random Number of Objects