AbstractIn the secretary problem one seeks to maximize the probability of hiring the best of N candidates who are interviewed in succession and must be accepted or rejected at the interview. A simple dynamic program is formulated and solved. Numerical results are given for secretary problems of small size
We present a generalization of a class of sequential search problems with ordinal ranks, referred to...
textabstractThe classical secretary problem studies the problem of selecting online an element (a “s...
The classical secretary problem studies the problem of selecting online an element (a “secretary”) w...
AbstractIn the secretary problem one seeks to maximize the probability of hiring the best of N candi...
ABSTRACT. The classical secretary problem involves sequentially interviewing a pool of n appli-cants...
The probability of selecting the ath best out of n applicants in the secretary problem is evaluated ...
The classical secretary problem is a well known optimal stopping problem from probability theory. It...
[[abstract]]We consider a natural variation of the standard secretary problem: N groups of applicant...
The effect of interview costs on the optimal selection strategy and on the chance of success in secr...
This discussion paper resulted in a publication in 'Probability in the Engineering and Informational...
Abstract The secretary problem with uncertain selection, considered by Smith, is generalized to allo...
A mathematical model of competitive selection of the applicants for a post is considered. There are ...
Optimal policies for various secretary problems have an undesirable trait: they would interview appl...
Abstract We consider the so-called secretary problem, in which an offer may be declined by each appl...
Sequential observation and selection behavior was examined in the context of employer hiring decisio...
We present a generalization of a class of sequential search problems with ordinal ranks, referred to...
textabstractThe classical secretary problem studies the problem of selecting online an element (a “s...
The classical secretary problem studies the problem of selecting online an element (a “secretary”) w...
AbstractIn the secretary problem one seeks to maximize the probability of hiring the best of N candi...
ABSTRACT. The classical secretary problem involves sequentially interviewing a pool of n appli-cants...
The probability of selecting the ath best out of n applicants in the secretary problem is evaluated ...
The classical secretary problem is a well known optimal stopping problem from probability theory. It...
[[abstract]]We consider a natural variation of the standard secretary problem: N groups of applicant...
The effect of interview costs on the optimal selection strategy and on the chance of success in secr...
This discussion paper resulted in a publication in 'Probability in the Engineering and Informational...
Abstract The secretary problem with uncertain selection, considered by Smith, is generalized to allo...
A mathematical model of competitive selection of the applicants for a post is considered. There are ...
Optimal policies for various secretary problems have an undesirable trait: they would interview appl...
Abstract We consider the so-called secretary problem, in which an offer may be declined by each appl...
Sequential observation and selection behavior was examined in the context of employer hiring decisio...
We present a generalization of a class of sequential search problems with ordinal ranks, referred to...
textabstractThe classical secretary problem studies the problem of selecting online an element (a “s...
The classical secretary problem studies the problem of selecting online an element (a “secretary”) w...
DOI
Add to ORKG