O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem

Moran Feldman, Ola Svensson, Rico Zenklusen. O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. pages 1189-1201, SIAM, 2015. [doi]

Abstract

Abstract is missing.