Selection of nonextremal candidates from a random sequence

DOI10.1007/BF00934083MaRDI QIDQ1157563zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1982

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00934083

zbMATH Keywords

optimal stoppingsecretary problemoptimal choicemonotone preference functions

Mathematics Subject Classification ID

Optimality conditions for problems involving randomness (49K45) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Cites work

• scientific article; zbMATH DE number 3629971 (Why is no real title available?)
• scientific article; zbMATH DE number 3357742 (Why is no real title available?)
• A Problem of Optimal Choice and Assignment
• Best-choice problems involving uncertainty of selection and recall of observations
• On a best choice problem with partial information
• Optimal Selection from a Random Sequence with Learning of the Underlying Distribution
• Optimal selection based on relative ranks with a random number of individuals
• The Best Choice Problem for a Random Number of Objects

Cited in

(5)

• Average number of candidates surveyed by the headhunter in the recruitment
• Sequential selections with minimization of failure
• The secretary problem: optimal selection with interview cost from two groups of candidates
• A unified approach for solving sequential selection problems
• OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE

This page was built for publication: Selection of nonextremal candidates from a random sequence

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