Only recently, progress has been made in obtaining o (log (rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012) presented a O ( (log (rank)) ...