Document

# Robust Algorithms for the Secretary Problem

## File

LIPIcs.ITCS.2020.32.pdf
• Filesize: 0.63 MB
• 26 pages

## Acknowledgements

We thank Thomas Kesselheim and Marco Molinaro for sharing their model and thoughts on robust secretary problems with us; these have directly inspired our model.

## Cite As

Domagoj Bradac, Anupam Gupta, Sahil Singla, and Goran Zuzic. Robust Algorithms for the Secretary Problem. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 32:1-32:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ITCS.2020.32

## Abstract

In classical secretary problems, a sequence of n elements arrive in a uniformly random order, and we want to choose a single item, or a set of size K. The random order model allows us to escape from the strong lower bounds for the adversarial order setting, and excellent algorithms are known in this setting. However, one worrying aspect of these results is that the algorithms overfit to the model: they are not very robust. Indeed, if a few "outlier" arrivals are adversarially placed in the arrival sequence, the algorithms perform poorly. E.g., Dynkin’s popular 1/e-secretary algorithm is sensitive to even a single adversarial arrival: if the adversary gives one large bid at the beginning of the stream, the algorithm does not select any element at all. We investigate a robust version of the secretary problem. In the Byzantine Secretary model, we have two kinds of elements: green (good) and red (rogue). The values of all elements are chosen by the adversary. The green elements arrive at times uniformly randomly drawn from [0,1]. The red elements, however, arrive at adversarially chosen times. Naturally, the algorithm does not see these colors: how well can it solve secretary problems? We show that selecting the highest value red set, or the single largest green element is not possible with even a small fraction of red items. However, on the positive side, we show that these are the only bad cases, by giving algorithms which get value comparable to the value of the optimal green set minus the largest green item. (This benchmark reminds us of regret minimization and digital auctions, where we subtract an additive term depending on the "scale" of the problem.) Specifically, we give an algorithm to pick K elements, which gets within (1-ε) factor of the above benchmark, as long as K ≥ poly(ε^{-1} log n). We extend this to the knapsack secretary problem, for large knapsack size K. For the single-item case, an analogous benchmark is the value of the second-largest green item. For value-maximization, we give a poly log^* n-competitive algorithm, using a multi-layered bucketing scheme that adaptively refines our estimates of second-max over time. For probability-maximization, we show the existence of a good randomized algorithm, using the minimax principle. We hope that this work will spur further research on robust algorithms for the secretary problem, and for other problems in sequential decision-making, where the existing algorithms are not robust and often tend to overfit to the model.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Adversary models
• Theory of computation → Streaming models
• Theory of computation → Design and analysis of algorithms
• Theory of computation → Packing and covering problems
• Theory of computation → Algorithmic game theory and mechanism design
##### Keywords
• stochastic optimization
• robust optimization
• secretary problem
• matroid secretary
• robust secretary

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Moshe Babaioff, Nicole Immorlica, and Robert Kleinberg. Matroids, secretary problems, and online mechanisms. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007.
2. Avrim Blum and Joel Spencer. Coloring Random and Semi-Random k-Colorable Graphs. J. Algorithms, 19(2):204-234, 1995.
3. Moses Charikar, Jacob Steinhardt, and Gregory Valiant. Learning from untrusted data. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 47-60, 2017.
4. Ning Chen, Nick Gravin, and Pinyan Lu. Optimal competitive auctions. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing, pages 253-262. ACM, 2014.
5. Kai-Min Chung, Michael Mitzenmacher, and Salil P. Vadhan. Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. Theory of Computing, 9:897-945, 2013.
6. Kenneth L. Clarkson and Peter W. Shor. Applications of random sampling in computational geometry. II. Discrete Comput. Geom., 4(5):387-421, 1989.
7. José R. Correa, Paul Dütting, Felix A. Fischer, and Kevin Schewior. Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution. In Proceedings of the 2019 ACM Conference on Economics and Computation, pages 3-17, 2019.
8. Nikhil R. Devanur and Thomas P. Hayes. The adwords problem: online keyword matching with budgeted bidders under random permutations. In ACM Conference on Electronic Commerce, pages 71-78, 2009.
9. Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A. Wilkens. Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In ACM Conference on Electronic Commerce, pages 29-38, 2011.
10. Ilias Diakonikolas. Algorithmic High-Dimensional Robust Statistics. Webpage http://www.iliasdiakonikolas.org/simons-tutorial-robust.html, 2018. Tutorial at Foundations of Data Science bootcamp.
11. Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane, Jerry Li, Ankur Moitra, and Alistair Stewart. Robustly Learning a Gaussian: Getting Optimal Error, Efficiently. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2683-2702, 2018.
12. Ilias Diakonikolas, Daniel M. Kane, and Alistair Stewart. Learning geometric concepts with nasty noise. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 1061-1073, 2018.
13. Eugene B Dynkin. The optimum choice of the instant for stopping a Markov process. In Soviet Math. Dokl, volume 4, pages 627-629, 1963.
14. Hossein Esfandiari, Nitish Korula, and Vahab Mirrokni. Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. ACM Transactions on Economics and Computation (TEAC), 6(3-4):14, 2018.
15. Uriel Feige and Joe Kilian. Heuristics for semirandom graph problems. Journal of Computer and System Sciences, 63(4):639-671, 2001.
16. Moran Feldman, Ola Svensson, and Rico Zenklusen. A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pages 1189-1201, 2015.
17. Thomas S Ferguson et al. Who solved the secretary problem? Statistical science, 4(3):282-289, 1989.
18. Naveen Garg, Anupam Gupta, Stefano Leonardi, and Piotr Sankowski. Stochastic analyses for online combinatorial optimization problems. In ACM-SIAM symposium on Discrete algorithms, pages 942-951, 2008.
19. Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, and Berthold Vöcking. Online independent set beyond the worst-case: Secretaries, prophets, and periods. In International Colloquium on Automata, Languages, and Programming, pages 508-519, 2014.
20. Gagan Goel and Aranyak Mehta. Online budgeted matching in random input models with applications to adwords. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008.
21. Anupam Gupta and Marco Molinaro. How the Experts Algorithm Can Help Solve LPs Online. Math. Oper. Res., 41(4):1404-1431, 2016.
22. Guru Prashanth Guruganesh and Sahil Singla. Online Matroid Intersection: Beating Half for Random Arrival. In International Conference on Integer Programming and Combinatorial Optimization, pages 241-253, 2017.
23. Thomas Kesselheim, Robert D. Kleinberg, and Rad Niazadeh. Secretary Problems with Non-Uniform Arrival Order. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, OR, USA, June 14-17, 2015, pages 879-888, 2015.
24. Thomas Kesselheim, Klaus Radke, Andreas Tönnis, and Berthold Vöcking. An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. In European Symposium on Algorithms, pages 589-600. Springer, 2013.
25. Thomas Kesselheim, Klaus Radke, Andreas Tönnis, and Berthold Vöcking. Primal beats dual on online packing LPs in the random-order model. In Symposium on Theory of Computing, 2014, pages 303-312, 2014.
26. Robert D. Kleinberg. A multiple-choice secretary algorithm with applications to online auctions. In ACM-SIAM Symposium on Discrete Algorithms, 2005.
27. Nitish Korula and Martin Pál. Algorithms for secretary problems on graphs and hypergraphs. In International Colloquium on Automata, Languages and Programming, pages 508-520. Springer, 2009.
28. Oded Lachish. O(log log Rank) Competitive Ratio for the Matroid Secretary Problem. In 55th IEEE Annual Symposium on Foundations of Computer Science, Philadelphia, PA, USA, October 18-21, pages 326-335, 2014.
29. Kevin A. Lai, Anup B. Rao, and Santosh Vempala. Agnostic Estimation of Mean and Covariance. In IEEE 57th Annual Symposium on Foundations of Computer Science, 2016.
30. Thodoris Lykouris, Vahab S. Mirrokni, and Renato Paes Leme. Stochastic bandits robust to adversarial corruptions. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, June 25-29, 2018, pages 114-122, 2018.
31. Mohammad Mahdian, Hamid Nazerzadeh, and Amin Saberi. Allocating online advertisement space with unreliable estimates. In Proceedings of the 8th ACM conference on Electronic commerce, pages 288-294. ACM, 2007.
32. Adam Meyerson. Online facility location. In Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on, pages 426-431. IEEE, 2001.
33. Vahab S Mirrokni, Shayan Oveis Gharan, and Morteza Zadimoghaddam. Simultaneous approximations for adversarial and stochastic online budgeted allocation. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pages 1690-1701, 2012.
34. Ankur Moitra. Robustness Meets Algorithms (Invited Talk). In 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, pages 3:1-3:1, 2018.
35. Marco Molinaro. Online and Random-order Load Balancing Simultaneously. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pages 1638-1650, 2017.
36. John von Neumann. Zur theorie der gesellschaftsspiele. Mathematische annalen, 100(1):295-320, 1928.
37. T Parthasarathy. On games over the unit square. SIAM Journal on Applied Mathematics, 19(2):473-476, 1970.
38. Aviad Rubinstein. Beyond matroids: secretary problem and prophet inequality with general constraints. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pages 324-332, 2016.
39. Aviad Rubinstein and Sahil Singla. Combinatorial prophet inequalities. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017.
40. Walter Rudin. Principles of mathematical analysis, volume 3. McGraw-hill New York, 1976.
41. Raimund Seidel. Backwards analysis of randomized geometric algorithms. In New trends in discrete and computational geometry, volume 10 of Algorithms Combin., pages 37-67. Springer, Berlin, 1993.