A mathematical model of competitive selection of the applicants for a post is considered. There are N applicants of similar qualifications on an interview list. The applicants come in a random order and their salary demands are distinct. Two managers, I and II, will interview them one at a time. The aim of the manager is to obtain the applicant which demands minimal salary. The candidate can be accepted only at the moment of its appearance. When both manager want to accept the same candidate, then some rule of assignment to one of the manager is applied. Any candidate hired by the manager will accept the offer with some given probability. An candidate can be hired only at the moment of its appearance. At each moment n one candidate is prese...
We consider a game G(n) played by two players. There are n independent random variables Z(1),...,Z(n...
Sequential observation and selection behavior was examined in the context of employer hiring decisio...
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 ...
Abstract The secretary problem with uncertain selection, considered by Smith, is generalized to allo...
AbstractIn the secretary problem one seeks to maximize the probability of hiring the best of N candi...
Consider a scenario in which there are multiple employers competing to hire the best possible employ...
Optimal policies for various secretary problems have an undesirable trait: they would interview appl...
The probability of selecting the ath best out of n applicants in the secretary problem is evaluated ...
Candidates arrive sequentially for an interview process which results in them being ranked relative ...
AbstractThis article considers a modification of the secretary problem with random number of applica...
[[abstract]]We consider a natural variation of the standard secretary problem: N groups of applicant...
ABSTRACT. The classical secretary problem involves sequentially interviewing a pool of n appli-cants...
AbstractGusein-Zade considered a version of the secretary problem in which we are allowed to make on...
We consider the best-choice secretary problem, with a known number, n, of applicants, and a random, ...
We consider a game G(n) played by two players. There are n independent random variables Z(1),...,Z(n...
Sequential observation and selection behavior was examined in the context of employer hiring decisio...
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 ...
Abstract The secretary problem with uncertain selection, considered by Smith, is generalized to allo...
AbstractIn the secretary problem one seeks to maximize the probability of hiring the best of N candi...
Consider a scenario in which there are multiple employers competing to hire the best possible employ...
Optimal policies for various secretary problems have an undesirable trait: they would interview appl...
The probability of selecting the ath best out of n applicants in the secretary problem is evaluated ...
Candidates arrive sequentially for an interview process which results in them being ranked relative ...
AbstractThis article considers a modification of the secretary problem with random number of applica...
[[abstract]]We consider a natural variation of the standard secretary problem: N groups of applicant...
ABSTRACT. The classical secretary problem involves sequentially interviewing a pool of n appli-cants...
AbstractGusein-Zade considered a version of the secretary problem in which we are allowed to make on...
We consider the best-choice secretary problem, with a known number, n, of applicants, and a random, ...
We consider a game G(n) played by two players. There are n independent random variables Z(1),...,Z(n...
Sequential observation and selection behavior was examined in the context of employer hiring decisio...
AbstractA total of n items arrive at random. The decision maker must either select or discard the cu...