We consider the best-choice secretary problem, with a known number, n, of applicants, and a random, independent "freeze" variable M, with known distribution. No hiring is possible after time M. The goal is to choose the best among the n applicants, where the decisions must be made depending only on the relative ranks of the applicants observed so far. A necessary and sufficient condition is given for the optimal rule to have the "simple" structure: let k* -- 1 applicants pass, and stop with the first applicant (if any) from the k*th onward, who is better than all previous observed candidates. For uniform, geometric and Poisson freeze variables the optimal rules are simple. Some asymptotic results (as n --> [infinity]), and minimax results a...
AbstractIn the secretary problem one seeks to maximize the probability of hiring the best of N candi...
AbstractThis article considers a modification of the secretary problem with random number of applica...
In the celebrated “Secretary Problem,” involving n candidates who have applied for a single vacant s...
AbstractGusein-Zade considered a version of the secretary problem in which we are allowed to make on...
The probability of selecting the ath best out of n applicants in the secretary problem is evaluated ...
Abstract The secretary problem with uncertain selection, considered by Smith, is generalized to allo...
Consider a scenario in which there are multiple employers competing to hire the best possible employ...
A total of n items arrive at random. The decision maker must either select or discard the current it...
ABSTRACT. The classical secretary problem involves sequentially interviewing a pool of n appli-cants...
No-information secretary problem with Poisson stream of applicants is considered. The values of the ...
AbstractA total of n items arrive at random. The decision maker must either select or discard the cu...
A mathematical model of competitive selection of the applicants for a post is considered. There are ...
AbstractIn this paper, we will consider optimal selection problems in which the recall of a random n...
The optimal stopping rules with multiple selections of m # 1 objects with the objective of maximiz...
In this thesis an optimal stopping problem related to the classical secretary problem is studied. Th...
AbstractIn the secretary problem one seeks to maximize the probability of hiring the best of N candi...
AbstractThis article considers a modification of the secretary problem with random number of applica...
In the celebrated “Secretary Problem,” involving n candidates who have applied for a single vacant s...
AbstractGusein-Zade considered a version of the secretary problem in which we are allowed to make on...
The probability of selecting the ath best out of n applicants in the secretary problem is evaluated ...
Abstract The secretary problem with uncertain selection, considered by Smith, is generalized to allo...
Consider a scenario in which there are multiple employers competing to hire the best possible employ...
A total of n items arrive at random. The decision maker must either select or discard the current it...
ABSTRACT. The classical secretary problem involves sequentially interviewing a pool of n appli-cants...
No-information secretary problem with Poisson stream of applicants is considered. The values of the ...
AbstractA total of n items arrive at random. The decision maker must either select or discard the cu...
A mathematical model of competitive selection of the applicants for a post is considered. There are ...
AbstractIn this paper, we will consider optimal selection problems in which the recall of a random n...
The optimal stopping rules with multiple selections of m # 1 objects with the objective of maximiz...
In this thesis an optimal stopping problem related to the classical secretary problem is studied. Th...
AbstractIn the secretary problem one seeks to maximize the probability of hiring the best of N candi...
AbstractThis article considers a modification of the secretary problem with random number of applica...
In the celebrated “Secretary Problem,” involving n candidates who have applied for a single vacant s...