Optimal selection of the four best of a sequence

DOI10.1007/BF01416612MaRDI QIDQ4277997zbMATH OpenOpenAlexFDO

Authors Aarni Lehtinen

Publication date 13 April 1994

Published in ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01416612

zbMATH Keywords

multi-choice problemoptimal stoppingsecretary problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40)

Recommendations

• Optimal selection of the \(k\) best of a sequence with \(k\) stops
• Recognizing the three best of a sequence
• Publication:3032101
• SELECTING SATISFACTORY SECRETARIES
• scientific article; zbMATH DE number 3928135

Cites work

• scientific article; zbMATH DE number 4130206 (Why is no real title available?)
• On a Generalization of the Best Choice Problem
• Recognizing both the maximum and the second maximum of a sequence
• The Secretary Problem and Its Extensions: A Review
• Who solved the secretary problem? With comments and a rejoinder by the author

Cited in

(3)

• Optimal selection of the \(k\) best of a sequence with \(k\) stops
• A best-choice problem with multiple selectors
• OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE

This page was built for publication: Optimal selection of the four best of a sequence

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