Shelf life of candidates in the generalized secretary problem
نویسندگان
چکیده
A version of the secretary problem called the duration problem, in which the objective is to maximize the time of possession of relatively best objects or the second best, is treated. It is shown that in this duration problem there are threshold numbers (k 1 , k ? 2) such that the optimal strategy immediately selects a relatively best object if it appears after time k 1 and a relatively second best object if it appears after moment k 2 . When number of objects tends to infinity the thresholds values are b0.417188Nc and c0.120381Nc, respectively. The asymptotic mean time of shelf life of the object is 0.403827N .
منابع مشابه
A generalization of the classical secretary problem
The classical secretary problem is a well known optimal stopping problem from probability theory. It is usually described by different real life examples, notably the process of hiring a secretary. Imagine a company manager in need of a secretary. Our manager wants to hire only the best secretary from a given set of n candidates, where n is known. No candidate is equally as qualified as another...
متن کاملDynamic Threshold Strategy for Universal Best Choice Problem
The secretary problem is one of the most commonly known best-choice problems. It models a situation of n candidates applying for a single secretary position. The candidates are interviewed in a random order. After each interview an irrevocable decision to accept or reject the current candidate is made. Once a candidate is accepted, no more interviews are arranged. All candidates are linearly or...
متن کاملSolving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
The classical secretary problem investigates the question of how to hire the best secretary from n candidates who come in a uniformly random order. In this work we investigate a parallel generalizations of this problem introduced by Feldman and Tennenholtz [14]. We call it shared Q-queue J-choice K-best secretary problem. In this problem, n candidates are evenly distributed into Q queues, and i...
متن کاملThe secretary problem : optimal selection with batch-interviewing and cost
— We consider the secretary problem when the candidates are interviewed in batches of two at each stage and cost of interviewing is present. Closedform asymptotic resuïts are derived and are compared with case when there is no recall of the candidates. There is a small réduction in the expected loss when the interview cost is a power functiôn which is nonconstant.
متن کاملThink Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions
The Temp Secretary Problem was recently introduced by Fiat et al. [11]. It is a generalization of the Secretary Problem, in which commitments are temporary for a fixed duration. We present a simple online algorithm with improved performance guarantees for cases already considered by Fiat et al. and give competitive ratios for new generalizations of the problem. In the classical setting, where c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 44 شماره
صفحات -
تاریخ انتشار 2016