Matroid Secretary Problems
Journal of the ACM, pp. 1-26, 2018.
We define a generalization of the classical secretary problem called the matroid secretary problem. In this problem, the elements of a matroid are presented to an online algorithm in uniformly random order. When an element arrives, the algorithm observes its value and must make an irrevocable decision whether or not to accept it. The acce...More
Full Text (Upload PDF)
PPT (Upload PPT)