The multi-returning secretary problem

DOI10.1016/J.DAM.2022.05.020MaRDI QIDQ2166212zbMATH OpenOpenAlexFDO

Authors L. Bayón, M. M. Ruiz, Pedro Fortuny Ayuso, José María Grau, Antonio M. Oller Marcén

Publication date 24 August 2022

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.07911

zbMATH Keywords

combinatorial optimizationdynamic programmingsecretary problemmulti-returning secretary problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Stopping times; optimal stopping problems; gambling theory (60G40) Games of timing (91A55)

Abstract: 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.

Recommendations

• A new look at the returning secretary problem
• scientific article; zbMATH DE number 3947461
• scientific article; zbMATH DE number 1766760
• scientific article; zbMATH DE number 1086999
• On Multiple Choice Secretary Problems

Cites work

• scientific article; zbMATH DE number 3858239 (Why is no real title available?)
• scientific article; zbMATH DE number 67283 (Why is no real title available?)
• scientific article; zbMATH DE number 3383344 (Why is no real title available?)
• A new look at the returning secretary problem
• A rank-based selection with cardinal payoffs and a cost of choice
• A secretary problem with uncertain employment
• Dynamic Programming and Decision Theory
• How to choose the best twins
• Lectures on analytic differential equations
• Sum the odds to one and stop
• The best-or-worst and the postdoc problems
• The best-or-worst and the postdoc problems with random number of candidates
• The returning secretary
• Who solved the secretary problem

Cited in

(3)

• A new method for computing asymptotic results in optimal stopping problems
• A new look at the returning secretary problem
• Packing returning secretaries

This page was built for publication: The multi-returning secretary problem

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