A unified approach to a class of best choice problems with an unknown number of options

DOI10.1214/aop/1176993237zbMath0553.60047WikidataQ57309396 ScholiaQ57309396MaRDI QIDQ802201

F. Thomas Bruss

Publication date: 1984

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

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

zbMATH Keywords

optimal stopping time; secretary problem; best choice problem; two person game

Mathematics Subject Classification ID

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

Related Items

An application of prophet regions to optimal stopping with a random number of observations, The Secretary Problem—An Update, Dokładna i asymptotyczna analiza rozwiązań optymalnych problemów zatrzymania Brussa i Webera, Odds -theorem and monotonicity, An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object, Stochastic processes with proportional increments and the last-arrival problem, No-information secretary problems with cardinal payoffs and Poisson arrivals, Invariant record processes and applications to best choice modelling, Embedding optimal selection problems in a Poisson process, The solution of a generalized secretary problem via analytic expressions, The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy, The 1/e-strategy is sub-optimal for the problem of best choice under no information, 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, The Temp Secretary Problem