A new look at the returning secretary problem

J. M. Grau Ribas ()
Additional contact information
J. M. Grau Ribas: Universidad de Oviedo

Journal of Combinatorial Optimization, 2019, vol. 37, issue 4, No 7, 1216-1236

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

Keywords: Secretary problem; Combinatorial optimization; 60G40; 62L15 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0349-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:4:d:10.1007_s10878-018-0349-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0349-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().