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

@article{Lachish2014OlogLR,
  title={O(log log Rank) Competitive Ratio for the Matroid Secretary Problem},
  author={Oded Lachish},
  journal={2014 IEEE 55th Annual Symposium on Foundations of Computer Science},
  year={2014},
  pages={326-335}
}
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… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS
31 Citations
24 References
Similar Papers

Similar Papers

Loading similar papers…