The classical Bomber problem concerns properties of the optimal allocation policy of arsenal for an airplane equipped with a given number, n, of anti-aircraft missiles, at a distance t 0 from its destination, which is intercepted by enemy planes appearing according to a homogeneous Poisson...

The classical secretary problem for selecting the best item is studied when the actual values of the items are observed with noise. One of the main appeals of the secretary problem is that the optimal strategy is able to find the best observation with the nontrivial probability of about 0.37,...

A new Secretary Problem is considered, where for fixed k and m one wins if at some time i = m(j .. 1) + 1 up to jm one selects one of the j best items among the first jm items, j = 1,...,k. Selection is based on relative ranks only. Interest lies in small k values, such as k = 2 or 3. This is...

The secretary problem for selecting one item so as to minimize its expected rank, based on observing the relative ranks only, is revisited. A simple suboptimal rule, which performs almost as well as the optimal rule, is given. The rule stops with the smallest i such that Ri = ic/(n + 1 - i) for...

The present paper studies the limiting behavior of the average score of a sequentially selected group of items or individuals, the underlying distribution of which, F, belongs to the Gumbel domain of attraction of extreme value distribution. This class contains the Normal, log Normal, Gamma,...