Approximate results for a generalized secretary problem

Details Approximate results for a generalized secretary problem Approximate results for a generalized secretary problem

2010-09-03

arxiv.org/abs/1009.0626v1

Mathematics

Probability

15 pages, 2 figures

Scientific paper

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 a preassigned (natural) 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 tends to infinity) results, which show that the double-level policy is an extremely accurate approximation.

Affiliated with

Also associated with

No associations

Rating

Approximate results for a generalized secretary problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximate results for a generalized secretary problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate results for a generalized secretary problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-684751