| Article ID: | iaor1995682 |
| Country: | United States |
| Volume: | 19 |
| Issue: | 3 |
| Start Page Number: | 597 |
| End Page Number: | 602 |
| Publication Date: | Aug 1994 |
| Journal: | Mathematics of Operations Research |
| Authors: | Preater J. |
| Keywords: | programming: dynamic |
Two secretary problems based on relative rank are considered, in which the decision maker has any fixed number of choices. In the first the payoff depends in an arbitrary way on acquisitions of ranks 1 and 2; in the second the aim is to maximise the probability of obtaining the best 3 objects. In each case the existence of an optimal selection policy of time threshold type is established.