Dynamic programming and the secretary problem (Q918875)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic programming and the secretary problem |
scientific article; zbMATH DE number 4160507
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic programming and the secretary problem |
scientific article; zbMATH DE number 4160507 |
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
0.8859687
0 references
0.8695345
0 references
0.86860836
0 references
0.86860836
0 references
0 references
0.86815834
0 references
0.8635515
0 references
