The Best Choice Problem for a Random Number of Objects

DOI10.1137/1117078zbMath0296.60031MaRDI 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

90B40: Search theory

60C05: Combinatorial probability

60G40: Stopping times; optimal stopping problems; gambling theory

62L15: Optimal stopping in statistics

Related Items

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