Recognizing the three best of a sequence

DOI10.5186/AASFM.1992.1709MaRDI QIDQ4278217zbMATH OpenOpenAlexFDO

Authors

Publication date 6 June 1994

Published in Annales Academiae Scientiarum Fennicae Series A I Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5186/aasfm.1992.1709

zbMATH Keywords

generalized best choice problemmutiple optimal stoppingsecretary problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• Three approaches to a sequence problem
• The signs of three-term recurrence sequences
• scientific article; zbMATH DE number 5073890
• Status of three classes of sequences
• Sequences of integers with three missing separations
• Three cousins of Recamán's sequence
• scientific article; zbMATH DE number 3946214

Cited in

(7)

• Optimal selection of the \(k\) best of a sequence with \(k\) stops
• How to choose the best twins
• Solving multi-choice secretary problem in parallel: an optimal observation-selection protocol
• scientific article; zbMATH DE number 4130206 (Why is no real title available?)
• Optimal selection of the four best of a sequence
• OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE
• Simulations of thresholds in multiple best choice problem

This page was built for publication: Recognizing the three best of a sequence

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