OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE

DOI10.1017/S0269964818000256MaRDI QIDQ5056626

Yi-Ching Yao, S.-R. Hsiau, Yi-Shen Lin

Publication date: 8 December 2022

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.00052

zbMATH Keywords

optimal stoppingbackward inductionbest choicesecretary problem

Mathematics Subject Classification ID

Statistics (62-XX) Operations research, mathematical programming (90-XX)

Related Items (1)

A unified approach for solving sequential selection problems

Cites Work

• Selection of nonextremal candidates from a random sequence
• Who solved the secretary problem
• The Secretary Problem and Its Extensions: A Review
• A Problem of Optimal Choice and Assignment
• Dynamic Programming and Decision Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE