Approximate Results for a Generalized Secretary Problem
AbstractThis discussion paper resulted in a publication in 'Probability in the Engineering and Informational Sciences' , 25(2), 157-69. A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is known, already for a long time, that for the optimal policy one needs to compute b position thresholds, for instance via backwards induction. In this paper we study approximate policies, that use just a single or a double position threshold, albeit in conjunction with a level rank. We give exact and asymptotic (as n goes to infinity) results, which show that the double-level policy is an extremely accurate approximation.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tinbergen Institute in its series Tinbergen Institute Discussion Papers with number 10-092/4.
Date of creation: 10 Sep 2010
Date of revision:
Contact details of provider:
Web page: http://www.tinbergen.nl
Secretary Problem; Dynamic Programming; Approximate Policies;
Find related papers by JEL classification:
- C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-02-26 (All new papers)
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antoine Maartens (+31 626 - 160 892)).
If references are entirely missing, you can add them using this form.