Strong Algorithms for the Ordinal Matroid Secretary Problem

José A. Soto, Abner Turkieltaub, Victor Verdugo. Strong Algorithms for the Ordinal Matroid Secretary Problem. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. pages 715-734, SIAM, 2018. [doi]

@inproceedings{SotoTV18,
  title = {Strong Algorithms for the Ordinal Matroid Secretary Problem},
  author = {José A. Soto and Abner Turkieltaub and Victor Verdugo},
  year = {2018},
  doi = {10.1137/1.9781611975031.47},
  url = {https://doi.org/10.1137/1.9781611975031.47},
  researchr = {https://researchr.org/publication/SotoTV18},
  cites = {0},
  citedby = {0},
  pages = {715-734},
  booktitle = {Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018},
  editor = {Artur Czumaj},
  publisher = {SIAM},
  isbn = {978-1-61197-503-1},
}