Optimal selection of the \(k\) best of a sequence with \(k\) stops

DOI10.1007/BF01217694zbMath0889.90096OpenAlexW114833516MaRDI QIDQ1374694

Aarni Lehtinen

Publication date: 10 December 1997

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

optimal stoppingsecretary problembest choice problem

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40)

Cites Work

• Unnamed Item
• Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items
• Who solved the secretary problem? With comments and a rejoinder by the author
• The Secretary Problem and Its Extensions: A Review
• Recognizing both the maximum and the second maximum of a sequence
• The Optimal Choice of a Subset of a Population
• The best choice problem with an unknown number of objects
• On a Generalization of the Best Choice Problem
• Optimal selection of the four best of a sequence
• Recognizing the three best of a sequence
• On Multiple Choice Secretary Problems

This page was built for publication: Optimal selection of the \(k\) best of a sequence with \(k\) stops