Probabilities of choosing applicants of arbitrary rank in the secretary problem

DOI10.2307/3214276zbMATH Open0621.60053OpenAlexW2314237616MaRDI QIDQ3757078FDOQ3757078

Authors: Peter A. Rogerson 

Publication date: 1987

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214276

Recommendations

• SELECTING SATISFACTORY SECRETARIES
• Secretary problem
• A unified approach to a class of best choice problems with an unknown number of options
• Remarks on the Secretary Problem
• scientific article; zbMATH DE number 1766760

zbMATH Keywords

order statisticsoptimal stopping ruleNumerical resultsSecretary Problemdecision numbers

Mathematics Subject Classification ID

Order statistics; empirical distribution functions (62G30) Stopping times; optimal stopping problems; gambling theory (60G40)

Cited In (16)

• Expected duration of the no-information minimum rank problem
• Remarks on the Secretary Problem
• Secretary problem with hidden information; searching for a high merit candidate
• Secretary problem
• An optimal algorithm for stopping on the element closest to the center of an interval
• Minimal expected ranks for the secretary problems with uncertain selection
• Title not available (Why is that?)
• The noisy secretary problem and some results on extreme concomitant variables
• Minimizing the expected rank with full information
• Title not available (Why is that?)
• The ``thirty-seven percent rule and the secretary problem with relative ranks
• Title not available (Why is that?)
• Duration of a secretary problem
• Some Extensions of Generalized Secretary Problem
• Optimal stopping methodology for the secretary problem with random queries
• Title not available (Why is that?)

This page was built for publication: Probabilities of choosing applicants of arbitrary rank in the secretary problem

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