A Secretary Problem with Uncertain Employment and Best Choice of Available Candidates

DOI10.1287/OPRE.39.2.274zbMATH Open0741.90090OpenAlexW2076902743MaRDI QIDQ3976912FDOQ3976912

Authors: Mitsushi Tamaki 

Publication date: 25 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.39.2.274

Recommendations

• Optimizing a single uncertain selection by recall of observations
• scientific article; zbMATH DE number 1766760
• The senior and junior secretaries problem
• A secretary problem with restricted offering chances and random number of applications
• Secretary problem
• The Secretary Problem with Optimal Assignment
• Dynamic programming and the secretary problem

zbMATH Keywords

secretary problembest choice problemuncertain employment

Mathematics Subject Classification ID

Dynamic programming (90C39) Stopping times; optimal stopping problems; gambling theory (60G40)

Cited In (8)

• A nonparametric predictive approach to sequential acceptance problems
• Optimal selection with randomly fading memory
• An interactive method for the optimal selection problem with two decision makers
• A secretary problem with missing observations
• A secretary problem with restricted offering chances and random number of applications
• Adaptive approach to some stopping problems
• Optimal choice of the best available applicant in full-information models
• Title not available (Why is that?)

This page was built for publication: A Secretary Problem with Uncertain Employment and Best Choice of Available Candidates

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