Handbook of combinatorics (vol. 1)
A multiple-choice secretary algorithm with applications to online auctions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Matroids, secretary problems, and online mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
Competitive Weighted Matching in Transversal Matroids
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Secretary problems: weights and discounts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Algorithms for Secretary Problems on Graphs and Hypergraphs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Constrained non-monotone submodular maximization: offline and secretary algorithms
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Improved competitive ratios for submodular secretary problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On variants of the matroid secretary problem
ESA'11 Proceedings of the 19th European conference on Algorithms
Improved competitive ratio for the matroid secretary problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Secretary problems: laminar matroid and interval scheduling
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Matroid secretary problem in the random assignment model
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Advances on matroid secretary problems: free order model and laminar case
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Hi-index | 0.00 |
The matroid secretary problem was introduced by Babaioff, Immorlica, and Kleinberg in SODA 2007 as an online problem that was both mathematically interesting and had applications to online auctions. In this column I will introduce and motivate this problem, and give a survey of some of the exciting work that has been done on it over the past 6 years. While we have a much better understanding of matroid secretary now than we did in 2007, the main conjecture is still open: does there exist an O(1)-competitive algorithm.