A Simple $O(\log \log (\mathrm{rank}))$-Competitive Algorithm for the Matroid Secretary Problem

Moran Feldman, Ola Svensson, Rico Zenklusen

Only recently progress has been made in obtaining $o(\log (\mathrm{rank}))$-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012)…