Dynamic programming and the secretary problem (Q918875): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Martin J. Beckmann / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Howard J. Weiner / rank | |||
Normal rank | |||
Revision as of 06:30, 22 February 2024
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
