On a best choice problem with partial information

DOI10.1214/AOS/1176345156MaRDI QIDQ1152194zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152194)