In the secretary problem we consecutively interview, for a single open position, ?$n \in \mathbb{N}_{\ge 2}$? applicants, with the goal of choosing the best. The decision of whether to reject or accept a given applicant must be made immediately following his interview. For large ?$n$?, approximately, it is optimal to decline the first ?$n/$e? candidates and then to hire the first one that is better than all his predecessors; the best being thus chosen with probability ?$1/e$?. The problem admits a precise and explicit solution for arbitrary ?$n$?.

Rights

URN

URN:NBN:SI:doc-4PNRHXPV

COBISSID

18050905

Added

14.02.2020

Metadata

Citation

APA:

Vidmar, Matija (2017). Problem izbire najboljše tajnice. Obzornik za matematiko in fiziko, volume 64, issue 1, str. 1-9. URN:NBN:SI:doc-4PNRHXPV from http://www.dlib.si

MLA:

Vidmar, Matija. "Problem izbire najboljše tajnice." Obzornik za matematiko in fiziko volume 64. issue 1 (2017) str. 1-9.
<http://www.dlib.si/?URN=URN:NBN:SI:doc-4PNRHXPV>

Obzornik za matematiko in fiziko
1951-
(Assembly record)