Hiring Secretaries over Time: The Benefit of Concurrent Employment

References

• [1] Alaei S (2014) Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM. J. Comput. 43(2):930–972.Crossref, Google Scholar
• [2] Ash JM, Berele A, Catoiu S (2012) Plausible and genuine extensions of l’Hospital’s rule. Math. Magazine 85(1):52–60.Crossref, Google Scholar
• [3] Bearden JN (2006) A new secretary problem with rank-based selection and cardinal payoffs. J. Math. Psych. 50(1):58–59.Crossref, Google Scholar
• [4] Bellman R (1954) The theory of dynamic programming. Bull. Amer. Math. Soc. 60(6):503–514.Crossref, Google Scholar
• [5] Cayley AF (1896) Mathematical Questions with Their Solutions. The Collected Mathematical Papers of Arthur Cayley, vol. 10 (Cambridge University Press, Cambridge, UK), 587–588.Google Scholar
• [6] Chawla S, Hartline JD, Malec DL, Sivan B (2010) Multi-parameter mechanism design and sequential posted pricing. Proc. 41st Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 311–320.Google Scholar
• [7] Dütting P, Kleinberg R (2015) Polymatroid prophet inequalities. Bansal N, Finocchi I, eds. Algorithms—ESA 2015, Lecture Notes in Computer Science, vol. 9294 (Springer, Berlin), 437–449.Crossref, Google Scholar
• [8] Esfandiari H, Hajiaghayi M, Liaghat V, Monemizadeh M (2015) Prophet secretary. Bansal N, Finocchi I, eds. Algorithms—ESA 2015, Lecture Notes in Computer Science, vol. 9294 (Springer, Berlin), 496–508.Crossref, Google Scholar
• [9] Ferguson TS (1989) Who solved the secretary problem? Statist. Sci. 4(3):282–289.Crossref, Google Scholar
• [10] Fiat A, Gorelik I, Kaplan H, Novgorodov S (2015) The temp secretary problem. Bansal N, Finocchi I, eds. Algorithms—ESA 2015, Lecture Notes in Computer Science, vol. 9294 (Springer, Berlin), 631–642.Crossref, Google Scholar
• [11] Fisher RA, Tippett LHC (1928) Limiting forms of the frequency distribution of the largest or smallest member of a sample. Math. Proc. Cambridge Philos. Soc. 24(2):180–190.Crossref, Google Scholar
• [12] Gilbert JP, Mosteller F (1966) Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61(313):35–73.Crossref, Google Scholar
• [13] Gnedenko BV (1943) Sur la distribution limite du terme maximum dune série aléatoire. Ann. Math. 44(3):423–453.Crossref, Google Scholar
• [14] Göbel O, Hoefer M, Kesselheim T, Schleiden T, Vöcking B (2014) Online independent set beyond the worst-case: Secretaries, prophets, and periods. Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E, eds. Automata, Languages, and Programming—ICALP 2014, Lecture Notes in Computer Science, vol. 8573 (Springer, Berlin), 508–519.Crossref, Google Scholar
• [15] Guttman I (1960) On a problem of L. Moser. Canadian Math. Bull. 3(1):35–39.Crossref, Google Scholar
• [16] Hajiaghayi MT, Kleinberg R, Sandholm T (2007) Automated online mechanism design and prophet inequalities. Proc. 22nd Natl. Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 58–65.Google Scholar
• [17] Hill TP, Kertz RP (1992) A survey of prophet inequalities in optimal stopping theory. Contemporary Math. 125(1):191–207.Crossref, Google Scholar
• [18] Karamata J (1933) Sur un mode de croissance régulière. Théorèmes fondamentaux. Bull. Soc. Math. France 61:55–62.Crossref, Google Scholar
• [19] Karlin S (1962) Stochastic models and optimal policy for selling an asset. Arrow KJ, Karlin S, Scarf H, eds. Studies in Applied Probability and Management Science (Stanford University Press, Stanford, CA), 148–158.Google Scholar
• [20] Kennedy DP (1987) Prophet-type inequalities for multi-choice optimal stopping. Stochastic Processes Appl. 24(1):77–88.Crossref, Google Scholar
• [21] Kennedy DP, Kertz RP (1991) The asymptotic behavior of the reward sequence in the optimal stopping of i.i.d. random variables. Ann. Probab. 19(1):329–341.Crossref, Google Scholar
• [22] Kleinberg R, Weinberg SM (2012) Matroid prophet inequalities. Proc. 44th Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 123–136.Crossref, Google Scholar
• [23] Krengel U, Sucheston L (1977) Semiamarts and finite values. Bull. Amer. Math. Soc. 83(4):745–747.Crossref, Google Scholar
• [24] Krengel U, Sucheston L (1978) On semiamarts, amarts, and processes with finite value. Kuelbs J, ed. Probability on Banach Spaces, Advances in Probability and Related Topics, vol. 4 (Dekker, New York), 197–266.Google Scholar
• [25] Leadbetter MR, Lindgren G, Rootzen H (1983) Extremes and Related Properties of Random Sequences and Processes (Springer, New York).Crossref, Google Scholar
• [26] Moser L (1956) On a problem of Cayley. Scripta Math. 22:289–292.Google Scholar
• [27] Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Link, Google Scholar
• [28] Rubinstein A (2016) Beyond matroids: Secretary problem and prophet inequality with general constraints. Proc. 48th Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 324–332.Crossref, Google Scholar
• [29] Rubinstein A, Singla S (2017) Combinatorial prophet inequalities. Proc. 28th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 1671–1687.Crossref, Google Scholar
• [30] Samuel-Cahn E (1984) Comparison of threshold stop rules and maximum for independent non-negative random variables. Ann. Probab. 12(4):1213–1216.Crossref, Google Scholar
• [31] Verroios V, Papadimitriou P, Johari R, Garcia-Molina H (2015) Client clustering for hiring modeling in work marketplaces. Proc. 21st ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery, New York), 2187–2196.Crossref, Google Scholar