The multi-returning secretary problem
Probability
2020-10-16 v2
Abstract
In this paper we consider the so-called Multi-returning secretary problem, a version of the Secretary problem in which each candidate has identical copies. The case has already been completely solved by several authors using different methods both the case had not been satisfactorily solved yet. Here, we provide and efficient algorithm to compute the optimal threshold and the probability of success for every . Moreover, we give a method to determine their asymtoptic values based on the solution of a system of ODEs.
Keywords
Cite
@article{arxiv.2009.07911,
title = {The multi-returning secretary problem},
author = {L. Bayon and P. Fortuny and J. M. Grau and A. Oller Marcen and M. M. Ruiz},
journal= {arXiv preprint arXiv:2009.07911},
year = {2020}
}