The Secretary Problem with an Unknown Number of Options

DOI10.1287/opre.29.1.130zbMath0454.90042OpenAlexW2121968529MaRDI QIDQ3902814

No author found.

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

secretary problemunknown number of optionsselection methodrandom sequence of unknown lengthselecting the best element

Mathematics Subject Classification ID

Operations research and management science (90B99)

Related Items (9)

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

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