A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Matroid Secretary Problem in the Random Assignment Model
[chapter]
2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms
The matroid secretary problem admits several variants according to the order in which the matroid's elements are presented and how the elements are assigned weights. As the main result of this article, we devise the first constant competitive algorithm for the model in which both the order and the weight assignment are selected uniformly at random, achieving a competitive ratio of approximately 5.7187. This result is based on the nontrivial fact that every matroid can be approximately
doi:10.1137/1.9781611973082.97
dblp:conf/soda/Soto11
fatcat:wvy3s4seqfb5zop52ayutdncm4