Dynamic programming and the secretary problem (Q918875)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming and the secretary problem |
scientific article |
Statements
Dynamic programming and the secretary problem (English)
0 references
1990
0 references
A simple dynamic program is formulated and solved for the secretary problem in which one seeks to maximize the probability of hiring the best of N candidates who are interviewed in succession and who must be accepted or rejected at the interview. Numerical results for small N are given.
0 references
secretary problem
0 references
