Optimal selection of the four best of a sequence

DOI10.1007/BF01416612zbMath0785.90096OpenAlexW2042777133MaRDI QIDQ4277997

Aarni Lehtinen

Publication date: 13 April 1994

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 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

optimal stoppingsecretary problemmulti-choice problem

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• 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
• On a Generalization of the Best Choice Problem

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