Anirban Majumdar

Algorithms for Robbins' Problem Using Markov Decision Processes

In this paper, we consider Robbins'problem, which is a full information variant of the well-known secretary selection problem. In this version of the problem, the goal is to minimize the expected rank of the selected candidate among $n$ that are interviewed sequentially, and a decision to select or not the $m^{th}$ can...