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

DOI10.1214/AOP/1176993237zbMath0553.60047OpenAlexW2051290144WikidataQ57309396 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 timesecretary problembest choice problemtwo person game

Mathematics Subject Classification ID

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

Related Items (18)

Adaptive approach to some stopping problems ⋮ Maximizing the probability of stopping on any of the last m successes in independent Bernoulli trials with random horizon ⋮ The Secretary Problem—An Update ⋮ The Temp Secretary Problem ⋮ 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 ⋮ An application of prophet regions to optimal stopping with a random number of observations ⋮ Invariant record processes and applications to best choice modelling ⋮ Stochastic processes with proportional increments and the last-arrival problem ⋮ Dokładna i asymptotyczna analiza rozwiązań optymalnych problemów zatrzymania Brussa i Webera ⋮ Odds -theorem and monotonicity ⋮ Embedding optimal selection problems in a Poisson process ⋮ Unnamed Item ⋮ The solution of a generalized secretary problem via analytic expressions ⋮ When to stop consulting ⋮ 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 ⋮ Recognising the last record of sequence

This page was built for publication: A unified approach to a class of best choice problems with an unknown number of options