1. Ajtai, M., Megiddo, N., Waarts, O.: Improved algorithms and analysis for secretary problems and generalizations. SIAM J. Discrete Math. 14, 1–27 (2001)
2. Archibald, M., Martinez, C.: The hiring problem and permutations. In: Proceedings of the 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), Discrete Mathematics and Theoretical Computer Science, pp. 63–76 (2009). Proceedings AK
3. Lecture Notes in Computer Science;M. Babaioff,2007
4. Lecture Notes in Computer Science;M. Bateni,2010
5. Broder, A., Kirsch, A., Kumar, R., Mitzenmacher, M., Upfal, E., Vassilvitskii, S.: The hiring problem and Lake Wobegon strategies. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1184–1193. ACM/SIAM, New York/Philadelphia (2008)