Strong Algorithms for the Ordinal Matroid Secretary Problem

Abstract:

A general technique and analysis for the matroid secretary problem is presented and then we show how to achieve a 4-competitive algorithm for the case
of graphic matroids.