Robust Algorithms for the Secretary Problem

Domagoj Bradac, Anupam Gupta, Sahil Singla 0001, Goran Zuzic. Robust Algorithms for the Secretary Problem. In Thomas Vidick, editor, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA. Volume 151 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

@inproceedings{BradacG0Z20,
  title = {Robust Algorithms for the Secretary Problem},
  author = {Domagoj Bradac and Anupam Gupta and Sahil Singla 0001 and Goran Zuzic},
  year = {2020},
  doi = {10.4230/LIPIcs.ITCS.2020.32},
  url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.32},
  researchr = {https://researchr.org/publication/BradacG0Z20},
  cites = {0},
  citedby = {0},
  booktitle = {11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12-14, 2020, Seattle, Washington, USA},
  editor = {Thomas Vidick},
  volume = {151},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-134-4},
}