A Generalized Secretary Problem

Abstract

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 compared with the classical rule, where one wins if one of… (More)

1 Figure or Table

Topics

  • Presentations referencing similar topics