A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is...

A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is...

A version of the classical secretary problem is studied, in which one is interested in selecting one of the <I>b</I> best out of a group of <I>n</I> differently ranked persons who are presented one by one in a random order. It is assumed that <I>b</I> is bigger than or equal to 1 is a preassigned number. It is...</i></i></i>