Optimal Sequential Selection of Secretaries

DOI10.1287/MOOR.10.4.709MaRDI QIDQ3703579zbMATH OpenOpenAlexFDO

Authors Colin L. Mallows, Vijayan N. Nair, Larry Shepp, Yehuda Vardi

Publication date 1985

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.10.4.709

zbMATH Keywords

asymptotically optimal procedureoptimal stoppingqueue of applicantssecretary selectionsequential choice

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Operations research and management science (90B99)

Recommendations

• SELECTING SATISFACTORY SECRETARIES
• A Generalized Problem of Optimal Selection and Assignment
• scientific article; zbMATH DE number 67285
• scientific article; zbMATH DE number 3947461
• The senior and junior secretaries problem

Cited in

(4)

• Asymptotic expansions and strategies in the online increasing subsequence problem
• Optimal sequential delegation
• Sequential selection of random vectors under a sum constraint
• A conversation with Vijay Nair

This page was built for publication: Optimal Sequential Selection of Secretaries

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