Secretary problem and two almost the same consecutive applicants Problem sekretarki z wyborem dwóch kandydatek o bliskich absolutnych rangach
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F22%3A00382634" target="_blank" >RIV/68407700:21340/22:00382634 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.14708/ma.v50i2.7143" target="_blank" >https://doi.org/10.14708/ma.v50i2.7143</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.14708/ma.v50i2.7143" target="_blank" >10.14708/ma.v50i2.7143</a>
Alternative languages
Result language
angličtina
Original language name
Secretary problem and two almost the same consecutive applicants Problem sekretarki z wyborem dwóch kandydatek o bliskich absolutnych rangach
Original language description
The classical secretary problem involves sequentially interviewing a pool of n applicants with the aim of hiring exactly the best one in the pool; nothing less is good enough. The decision maker’s strategy should maximize the probability of appropriate selection. The various modifications of the aim under the probability maximization criterion do not contain the issue of selecting the pairs of secretaries of very close absolute ranks. This paper is devoted to such a concern, which is formulated in a rigorous way. The effectiveness of the threshold rules is analyzed. It is shown that the asymptotic probability of success in this class of strategies may achieve 0.5.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10103 - Statistics and probability
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Mathematica Applicanda
ISSN
1730-2668
e-ISSN
2299-4009
Volume of the periodical
50
Issue of the periodical within the volume
2
Country of publishing house
PL - POLAND
Number of pages
17
Pages from-to
165-181
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85152779332