The secretary problem : optimal selection with batch-interviewing and cost

DOI10.1051/RO/1992260403911MaRDI QIDQ4033528zbMATH OpenOpenAlexFDO

Authors Z. Govindarajulu

Publication date 16 May 1993

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105046

zbMATH Keywords

closed form asymptotic resultsexpected lossinterview costinterview in batchesoptimal selectionpowerful functionsecretary problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Recommendations

• The secretary problem: optimal selection with interview cost from two groups of candidates
• scientific article; zbMATH DE number 513207
• scientific article; zbMATH DE number 67285
• The secretary problem with a call option
• A SELECTION PROBLEM WITH COST : 'SECRETARY PROBLEM' WHEN UNLIMITED RECALL IS ALLOWED

Cited in

(4)

• Selecting the best choice in the weighted secretary problem
• scientific article; zbMATH DE number 67285 (Why is no real title available?)
• The secretary problem: optimal selection with interview cost from two groups of candidates
• The last-success stopping problem with random observation times

This page was built for publication: The secretary problem : optimal selection with batch-interviewing and cost

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