Abstract
We consider a version of the secretary problem in which each candidate has an identical twin. As in the classical secretary problem, the aim is to choose a top candidate, i.e., one of the best twins, with the highest possible probability. We find an optimal stopping rule for such a choice, the probability of success, and its asymptotic behavior. We use a novel technique that allows the problem to be solved exactly in linear time and obtain the asymptotic values by solving differential equations. Furthermore, the proposed technique may be used to study the variants of the same problem and in other optimal stopping problems.
Similar content being viewed by others
References
Bayón L, Fortuny P, Grau JM, Oller-Marcén AM, Ruiz MM (2017) The best-or-worst and the postdoc problems. J Comb Optim 35(3):703–723
Babaioff M, Immorlica N, Kleinberg R (2007) Matroids, secretary problems, and online mechanisms. In: Proceedings of SODA, pp 434–443
Bearden JN (2006) A new secretary problem with rank-based selection and cardinal payoffs. J Math Psychol 50:58–59
Dynkin EB (1963) the optimum choice of the instant for stopping a markov process. Sov Math Dokl 4:627–629
Ferguson TS (1989) Who solved the secretary problem? Stat Sci 4(3):282–296
Ferguson TS, Hardwick JP, Tamaki M (1991) Maximizing the duration of owning a relatively best object. In: Ferguson T, Samuels S (eds) Contemporary mathematics: strategies for sequential search and selection in real time, vol 125. American Mathematics Association, Washington, pp 37–58
Freij R, Wastlund J (2010) Partially ordered secretaries. Electron Commun Probab 15:504–507
Garrod B (2011) Problems of optimal choice on posets and generalizations of acyclic colourings. PhD Thesis
Garrod B, Morris R (2012) The secretary problem on an unknown poset. Random Struct Algorithms 43(4):429–451
Garrod B, Kubicki G, Morayne M (2012) How to choose the best twins. Siam J Discrete Math 26(1):384–398
Georgiou N, Kuchta M, Morayne M, Niemiec J (2008) On a universal best choice algorithm for partially ordered sets. Random Struct Algorithms 32:263–273
Gilbert J, Mosteller F (1966) Recognizing the maximum of a sequence. J Am Stat Assoc 61:35–73
Lindley DV (1961) Dynamic programming and decision theory. J R Stat Soc Ser C (Appl Stat) 10(1):39–51
Soto JA (2011) Matroid secretary problem in the random assignment model. In: Proceedings of SODA, pp 1275–1284
Szajowski KA (2009) A rank-based selection with cardinal payoffs and a cost of choice. Sci Math Jpn 69(2):285–293
Vardi S (2014) The secretary returns. arXiv:1404.0614
Vardi S (2015) The returning secretary. In: 32nd International symposium on theoretical aspects of computer science (STACS 2015), Leibniz international proceedings in informatics (LIPIcs), pp 716–729
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ribas, J.M.G. A new look at the returning secretary problem. J Comb Optim 37, 1216–1236 (2019). https://doi.org/10.1007/s10878-018-0349-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-018-0349-8