On a best choice problem with partial information

DOI10.1214/AOS/1176345156zbMath0459.62071OpenAlexW2074531736MaRDI QIDQ1152194

Joseph D. Petruccelli

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1214/aos/1176345156

zbMATH Keywords

invariancesecretary problemminimax rules

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Optimal stopping in statistics (62L15)

Related Items (13)

On best choice problems having similar solutions ⋮ Why do these quite different best-choice problems have the same solutions? ⋮ Optimal Stopping of a Random Sequence with Unknown Distribution ⋮ An empirical bayes solution to the best–choice problem ⋮ Shelf life of candidates in the generalized secretary problem ⋮ Running minimum in the best-choice problem ⋮ Selection of nonextremal candidates from a random sequence ⋮ Robust best choice problem ⋮ Best choice from the planar Poisson process ⋮ Objectives in the Best-Choice Problems ⋮ An empirical bayes adaptive price search^∗ ⋮ Winning Rate in the Full-Information Best-Choice Problem ⋮ An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object

This page was built for publication: On a best choice problem with partial information