1. Ajtai, M., Megiddo, N., Waarts, O.: Improved algorithms and analysis for secretary problems and generalizations. SIAM J. Discret. Math. 14, 1–27 (2001)
2. Archibald, M., Martínez, C.: The hiring problem and permutations. In: Proc. of the 21st Int. Col. on Formal Power Series and Algebraic Combinatorics (FPSAC), volume AK of Discrete Mathematics & Theoretical Computer Science Proceedings, pp. 63–76 (2009)
3. Arnold, B.C., Balakrishnan, N., Nagaraja, H.N.: Records. Wiley Series in Probability and Mathematical Statistics. Wiley, New York (1998)
4. Bateni, M., Hajiaghayi, M., Zadimoghaddam, M.: Submodular secretary problem and extensions. In: Proc. of APPROX-RANDOM 2010, volume 6302 of Lecture Notes in Computer Science, pp. 39–52. Springer (2010)
5. Broder, A.Z., Kirsch, A., Kumar, R., Mitzenmacher, M., Upfal, E., Vassilvitskii, S.: The hiring problem and Lake Wobegon strategies. In: Proc. of the $$19^\text{ th }$$ 19 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’08), pp. 1184–1193. SIAM, Philadelphia, (2008)