Technical Note—On Hiring Secretaries with Stochastic Departures

References

• Alpern S, Baston V (2017) The secretary problem with a selection committee: Do conformist committees hire better secretaries? Management Sci. 63(4):1184–1197.Link, Google Scholar
• Babaioff M, Immorlica N, Kleinberg R (2007) Matroids, secretary problems, and online mechanisms. Proc. 18th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 434–443.Google Scholar
• Babaioff M, Immorlica N, Kempe D, Kleinberg R (2008) Online auctions and generalized secretary problems. ACM SIGecom Exchanges 7(2):1–11.Crossref, Google Scholar
• Bearden JN, Rapoport A, Murphy RO (2006) Sequential observation and selection with rank-dependent payoffs: An experimental study. Management Sci. 52(9):1437–1449.Link, Google Scholar
• Bruss FT (2000) Sum the odds to one and stop. Ann. Probab. 28:1384–1391.Crossref, Google Scholar
• Chow Y, Moriguti S, Robbins H, Samuels S (1964) Optimal selection based on relative rank (the “secretary problem”). Israel J. Math. 2(2):81–90.Crossref, Google Scholar
• Cownden D, Steinsaltz D (2014) Effects of competition in a secretary problem. Oper. Res. 62(1):104–113.Link, Google Scholar
• Dynkin EB (1963) The optimal choice of the instant for stopping a Markov process. Soviet Math. Doklady 4:627–629.Google Scholar
• Ferguson TS (1989) Who solved the secretary problem? Statist. Sci. 4:282–296.Crossref, Google Scholar
• Freeman P (1983) The secretary problem and its extensions: A review. Internat. Statist. Rev. 51(2):189–206.Crossref, Google Scholar
• Gardner M (1960) Mathematical games. Sci. Amer. 202(152):178–179.Google Scholar
• Gilbert JP, Mosteller F (1966) Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61(313):35–73.Crossref, Google Scholar
• Goldstein DG, McAfee RP, Suri S, Wright JR (2019) Learning when to stop searching. Management Sci. 66(3):1375–1394.Link, Google Scholar
• Goldys B (1978) The secretary problem: The case with memory for one step. Demonstratio Math. 11:789–799.Google Scholar
• Hajiaghayi MT, Kleinberg RD, Parkes DC (2004) Adaptive limited-supply online auctions. Proc. Fifth ACM Conf. Electronic Commerce (EC) (ACM, New York), 71–80.Google Scholar
• Ho S, Krishnan A (2015) A secretary problem with a sliding window for recalling applicants. Preprint, submitted August 31, https://doi.org/10.48550/arXiv.1508.07931.Google Scholar
• Hoefer M, Wilhelmi L (2021) Packing returning secretaries. Networks 77:454–471.Crossref, Google Scholar
• Lindley D (1961) Dynamic programming and decision theory. J. Royal Statist. Soc. Ser. C Appl. Statist. 10:39–52.Google Scholar
• Palley AB, Kremer M (2014) Sequential search and learning from rank feedback: Theory and experimental evidence. Management Sci. 60(10):2525–2542.Link, Google Scholar
• Petruccelli JD (1981) Best-choice problems involving uncertainty of selection and recall of observations. J. Appl. Probab. 18(2):415–425.Crossref, Google Scholar
• Smith MH, Deely JJ (1975) A secretary problem with finite memory. J. Amer. Statist. Assoc. 70(350):357–361.Crossref, Google Scholar
• Vardi S (2015) The returning secretary. 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015) (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany), 716–729.Google Scholar
• Zwick R, Rapoport A, Lo AKC, Muthukrishnan AV (2003) Consumer sequential search: Not enough or too much? Marketing Sci. 22(4):503–519.Link, Google Scholar