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...

This paper, using the different alternative methods of dynamic optimization (the Lagrange/Kuhn-Tucker (LKT) method, the substitution method, the Hamiltonian method, and the dynamic programming approach) derives the conditions that must be satisfied by the solution to the so-called Ramsey...