The infinite secretary problem with recall

DOI10.1214/AOP/1176989273zbMATH Open0776.60057OpenAlexW2089948495MaRDI QIDQ686772FDOQ686772

Authors: Amy L. Rocha 

Publication date: 11 October 1993

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176989273

Recommendations

• Best-choice problems involving recall and uncertainty of selection when the number of observations is random
• OPTIMAL STOPPING PROBLEM WITH UNCERTAIN RECALL
• An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object
• Optimal selection with randomly fading memory
• A SELECTION PROBLEM WITH COST : 'SECRETARY PROBLEM' WHEN UNLIMITED RECALL IS ALLOWED

zbMATH Keywords

asymptotic expansionsoptimal stopping timesecretary problemdifferential-delay equationmaximum probability of best choicerecall problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Cited In (2)

• An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object
• Sum the odds to one and stop

This page was built for publication: The infinite secretary problem with recall

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