The duration problem with multiple exchanges

Details The duration problem with multiple exchanges The duration problem with multiple exchanges

2008-12-19

arxiv.org/abs/0812.3765v1

Mathematics

Probability

30 pages

Scientific paper

We treat a version of the multiple-choice secretary problem called the multiple-choice duration problem, in which the objective is to maximize the time of possession of relatively best objects. It is shown that, for the $m$--choice duration problem, there exists a sequence (s1,s2,...,sm) of critical numbers such that, whenever there remain k choices yet to be made, then the optimal strategy immediately selects a relatively best object if it appears at or after time $s_k$ ($1\leq k\leq m$). We also exhibit an equivalence between the duration problem and the classical best-choice secretary problem. A simple recursive formula is given for calculating the critical numbers when the number of objects tends to infinity. Extensions are made to models involving an acquisition or replacement cost.

Affiliated with

Also associated with

No associations

Rating

The duration problem with multiple exchanges 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 The duration problem with multiple exchanges, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The duration problem with multiple exchanges will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727013