Interview Costs in the Secretary Problem

DOI10.1111/1467-842X.00024MaRDI QIDQ4248160zbMATH OpenOpenAlexFDO

Authors Geoffrey F. Yeo

Publication date 7 November 1999

Published in Australian <html_ent glyph="@amp;" ascii="&amp;"/> New Zealand Journal of Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/1467-842x.00024

zbMATH Keywords

asymptoticscombinatoricsselection timesuccess probability

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(7)

• Sequential selections with minimization of failure
• The secretary problem from the applicant's point of view
• A Best-Choice Problem With Linear Travel Cost
• scientific article; zbMATH DE number 513207 (Why is no real title available?)
• The secretary problem: optimal selection with interview cost from two groups of candidates
• Minimax strategies for discounted ?secretary problems? with interview costs
• A SELECTION PROBLEM WITH COST : 'SECRETARY PROBLEM' WHEN UNLIMITED RECALL IS ALLOWED

This page was built for publication: Interview Costs in the Secretary Problem

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