The Secretary Problem with Independent Sampling

The authors thank Daniel Goldstein, Preston McAfee, Siddharth Suri, and James Wright for kindly sharing their data with us; the review team whose remarks improved the contents and exhibition of this work significantly; Pranav Nuti for bringing up the work of Campbell and Samuels (1981); and Matthew Faw for pointing out the connection to the graphical and laminar matroid secretary problem. An earlier version of this article has been published in the proceedings of the ACM-SIAM Symposium on Discrete Algorithms 2021 conference (Correa et al. 2021a).