Displaying similar documents to “About secretary problems”

The "Thirty-seven Percent Rule" and the secretary problem with relative ranks

Béla Bajnok, Svetoslav Semov (2014)

Discussiones Mathematicae Probability and Statistics

Similarity:

We revisit the problem of selecting an item from n choices that appear before us in random sequential order so as to minimize the expected rank of the item selected. In particular, we examine the stopping rule where we reject the first k items and then select the first subsequent item that ranks lower than the l-th lowest-ranked item among the first k. We prove that the optimal rule has k ~ n/e, as in the classical secretary problem where our sole objective is to select the item of lowest...

Variants of the time minimization assignment problem.

Rita Malhotra, H. L. Bhatia (1984)

Trabajos de Estadística e Investigación Operativa

Similarity:

The present paper develops techniques to solve two variants of the time minimization assignment problem. In the first, there are n jobs to be assigned to m establishments (m < n) in such a way that the time taken to complete all the jobs is the minimum, it being assumed that all the jobs are commenced simultaneously. The second variant is an extension of the first one in the sense that an additional constraint on the minimum number of jobs to be taken up by each establishment...