scientific article; zbMATH DE number 3901857

MaRDI QIDQ3680113zbMATH OpenFDO

Authors Joseph D. Petruccelli

Publication date 1984

zbMATH Keywords

full information caseinvariancelocation-scale parameter familyno information caseoptimal asymptotical procedurespartial information casesecretary problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Foundations and philosophical topics in statistics (62A01) Minimax procedures in statistical decision theory (62C20) Optimal stopping in statistics (62L15)

Recommendations

• A sharp bound for winning within a proportion of the maximum of a sequence
• scientific article; zbMATH DE number 3928135
• Minimizing the expected rank with full information
• Strategies in the secretary problem
• Optimal Stopping for I.I.D. Random Variables Based on the Sequential Information of the Location of Relative Records Only
• Optimal selection based on relative ranks of a sequence by ties
• The best choice problem with an unknown number of objects
• Minimax-optimal stop rules and distributions in secretary problems

Cited in

(8)

• scientific article; zbMATH DE number 5869413 (Why is no real title available?)
• scientific article; zbMATH DE number 3968248 (Why is no real title available?)
• On the full information best-choice problem
• Why do these quite different best-choice problems have the same solutions?
• scientific article; zbMATH DE number 758012 (Why is no real title available?)
• Optimal rules for the sequential selection of uniform spacings
• Winning Rate in the Full-Information Best-Choice Problem
• A Full-Information Best-Choice Problem with Allowance

This page was built for publication:

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