Probabilities of choosing applicants of arbitrary rank in the secretary problem (Q3757078)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4007365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilities of choosing applicants of arbitrary rank in the secretary problem |
scientific article; zbMATH DE number 4007365 |
Statements
Probabilities of choosing applicants of arbitrary rank in the secretary problem (English)
0 references
1987
0 references
decision numbers
0 references
order statistics
0 references
Secretary Problem
0 references
optimal stopping rule
0 references
Numerical results
0 references
0.8985949158668518
0 references
0.866770327091217
0 references
0.8651736378669739
0 references
In the literature, various versions of the classical Secretary Problem have been studied in detail, and the optimal stopping rule has been obtained explicitly or numerically. This paper considers four such versions, and calculates for each the probability of selecting an applicant of arbitrary rank when the optimal rule is used. These four versions are: 1) No information (the decision is based on ranks only), and the objective is to maximize the probability of choosing the best; 2) No information, and the objective is to minimize the expected rank; 3) Full information (the decision is based on the values, or quality, of the applicants) and the objective is to maximize the probability of choosing the best; 4) Full information, and the objective is to maximize the expected quality. Numerical results for various values of N (number of applicants) are also given.
0 references