Secretary Problems via Linear Programming

A new linear programming technique is introduced as a tool for obtaining and analyzing mechanisms for the secretary problem and its variants and a family of linear programs which characterize all mechanisms that are allowed to choose J candidates and gain profit from the K best candidates are shown.