Autor: |
L. Bayón, P. Fortuny Ayuso, J.M. Grau, A.M. Oller-Marcén, M.M. Ruiz |
Rok vydání: |
2022 |
Předmět: |
|
Zdroj: |
Discrete Applied Mathematics. 320:33-46 |
ISSN: |
0166-218X |
DOI: |
10.1016/j.dam.2022.05.020 |
Popis: |
In this paper we consider the so-called Multi-returning secretary problem, a version of the Secretary problem in which each candidate has $m$ identical copies. The case $m=2$ has already been completely solved by several authors using different methods both the case $m>2$ had not been satisfactorily solved yet. Here, we provide and efficient algorithm to compute the optimal threshold and the probability of success for every $m$. Moreover, we give a method to determine their asymtoptic values based on the solution of a system of $m$ ODEs. |
Databáze: |
OpenAIRE |
Externí odkaz: |
|