Abstract
Only recently progress has been made in obtaining o (1og (rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012) presented a O (√log (rank))-competitive procedure, and Lachish (2014) recently presented a O (1oglog (rank))-competitive algorithm. Both algorithms aie involved with complex analyses. Using different tools, we present a considerably simpler O (1oglog (rank))-competitive algorithm. Our algorithm can be interpreted as a distribution over a simple type of matroid secretary algorithms which are easy to analyze. We are also able to vastly improve on the hidden constant in the competitive ratio.
| Original language | English |
|---|---|
| Pages | 1189-1201 |
| Number of pages | 13 |
| State | Published - 2015 |
| Externally published | Yes |
| Event | 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015 - San Diego, United States Duration: 4 Jan 2015 → 6 Jan 2015 |
Conference
| Conference | 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015 |
|---|---|
| Country/Territory | United States |
| City | San Diego |
| Period | 4/01/15 → 6/01/15 |
Keywords
- Matroids
- Online algorithms
- Secretary problem