O(log log Rank) Competitive Ratio for the Matroid Secretary Problem

In the Matroid Secretary Problem (MSP), the elements of the ground set of a Matroid are revealed on-line one by one, each together with its value. An algorithm for the MSP is called Matroid-Unknown if, at every stage of its execution, it only knows (i) the elements that have been revealed so far and their values and (ii) an oracle for testing whether or not a subset the elements that have been revealed so far forms an independent set. An algorithm is called Known-Cardinality if it knows (i), (ii) and also knows from the start the cardinality n of the ground set of the Matroid. We present here a Known-Cardinality algorithm with a competitive-ratio of order log log the rank of the Matroid. The prior known results for a OC algorithm are a competitive-ratio of log the rank of the Matroid, by Babaioff et al. (2007), and a competitive-ratio of square root of log the rank of the Matroid, by Chakraborty and Lachish (2012).

[1]  Patrick Jaillet,et al.  Advances on Matroid Secretary Problems: Free Order Model and Laminar Case , 2012, IPCO.

[2]  Jan Vondrák,et al.  On Variants of the Matroid Secretary Problem , 2013, Algorithmica.

[3]  C. Greg Plaxton,et al.  Competitive Weighted Matching in Transversal Matroids , 2008, Algorithmica.

[4]  Joseph Naor,et al.  Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) , 2011, APPROX-RANDOM.

[5]  Yajun Wang,et al.  Secretary problems: laminar matroid and interval scheduling , 2011, SODA '11.

[6]  Sourav Chakraborty,et al.  Improved competitive ratio for the matroid secretary problem , 2012, SODA.

[7]  Aaron Roth,et al.  Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms , 2010, WINE.

[8]  Morteza Zadimoghaddam,et al.  Submodular secretary problem and extensions , 2013, TALG.

[9]  Mohit Singh,et al.  Secretary Problems via Linear Programming , 2010, IPCO.

[10]  P. Freeman.  The Secretary Problem and its Extensions: A Review , 1983 .

[11]  S. Matthew Weinberg,et al.  Prophet Inequalities with Limited Information , 2013, SODA.

[12]  Roy Schwartz,et al.  Improved competitive ratios for submodular secretary problems , 2011 .

[13]  Robert D. Kleinberg.  A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.

[14]  Nicole Immorlica,et al.  A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.

[15]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[16]  Michael Dinitz,et al.  Recent advances on the matroid secretary problem , 2013, SIGA.

[17]  Michael Dinitz,et al.  Matroid Secretary for Regular and Decomposable Matroids , 2012, SIAM J. Comput..

[18]  José A. Soto,et al.  Matroid secretary problem in the random assignment model , 2010, SODA '11.

[19]  Shuchi Chawla,et al.  Secretary Problems with Convex Costs , 2011, ICALP.

[20]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[21]  Nicole Immorlica,et al.  Matroids, secretary problems, and online mechanisms , 2007, SODA '07.

[22]  Martin Pál,et al.  Algorithms for Secretary Problems on Graphs and Hypergraphs , 2008, ICALP.

[23]  David Lindley,et al.  Dynamic Programming and Decision Theory , 1961 .