A Random Arrival Time Best-Choice Problem with Uniform Prior on the Number of Arrivals
From MaRDI portal
Publication:3059307
DOI10.1007/978-0-387-89496-6_24zbMath1216.60038OpenAlexW101021092MaRDI QIDQ3059307
Publication date: 8 December 2010
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-89496-6_24
Related Items (2)
Maximizing the probability of stopping on any of the last m successes in independent Bernoulli trials with random horizon ⋮ The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy
This page was built for publication: A Random Arrival Time Best-Choice Problem with Uniform Prior on the Number of Arrivals