Dynamic programming and the secretary problem (Q918875): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Martin J. Beckmann / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Howard J. Weiner / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5653410 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite state Markovian decision processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3022029 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic Programming and Decision Theory / rank | |||
Normal rank |
Latest revision as of 10:26, 21 June 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