The Secretary Problem with an Unknown Number of Options

DOI10.1287/OPRE.29.1.130MaRDI QIDQ3902814zbMATH OpenOpenAlexFDO

Authors

Publication date 1981

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

random sequence of unknown lengthsecretary problemselecting the best elementselection methodunknown number of options

Mathematics Subject Classification ID

Operations research and management science (90B99)

Cited in

(9)

• Invariant record processes and applications to best choice modelling
• Embedding optimal selection problems in a Poisson process
• The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy
• The 1/e-strategy is sub-optimal for the problem of best choice under no information
• An empirical bayes solution to the best–choice problem
• An empirical bayes adaptive price search^∗
• The last-success stopping problem with random observation times
• No-information secretary problems with cardinal payoffs and Poisson arrivals
• Optimal stopping problems by two or more decision makers: a survey

This page was built for publication: The Secretary Problem with an Unknown Number of Options

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