Abstract
We consider a generalization of the secretary problem where contracts are temporary, and for a fixed duration γ. This models online hiring of temporary employees, or online auctions for re-usable resources. The problem is related to the question of finding a large independent set in a random unit interval graph.
Research Supported by The Israeli Centers of Research Excellence (I-CORE) Program (Center No. 4/11), and by ISF Grant no. 822/10.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: Weights and discounts. In: SODA 2009, pp. 1245–1254 (2009)
Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.D.: A knapsack secretary problem with applications. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 16–28. Springer, Heidelberg (2007)
Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exch. 7(2), 1–11 (2008)
Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA 2007, pp. 434–443. SIAM (2007)
Badanidiyuru, A., Kleinberg, R., Singer, Y.: Learning on a budget: Posted price mechanisms for online procurement. In: EC 2012, pp. 128–145 (2012)
Boucheron, S., Fernandez de la Vega, W.: On the independence number of random interval graphs. Combinatorics, Probability and Computing 10, 385–396 (2001)
Thomas Bruss, F.: A unified approach to a class of best choice problems with an unknown number of options. Ann. Probab. 12(3), 882–889 (1984)
Chakraborty, S., Lachish, O.: Improved competitive ratio for the matroid secretary problem. In: SODA 2012, pp. 1702–1712. SIAM (2012)
Coffman Jr., E.G., Poonen, B., Winkler, P.: Packing random intervals. Probability Theory and Related Fields 102(1), 105–121 (1995)
Devanur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: EC 2009, pp. 71–78 (2009)
Dinitz, M.: Recent advances on the matroid secretary problem. SIGACT News 44(2), 126–142 (2013)
Dynkin, E.B.: The optimal choice of the stopping moment for a markov process. Dokl. Akad. Nauk. SSSR, 238–240 (1963)
Feldman, M., Naor, J(S.), Schwartz, R.: Improved competitive ratios for submodular secretary problems (Extended abstract). In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) RANDOM 2011 and APPROX 2011. LNCS, vol. 6845, pp. 218–229. Springer, Heidelberg (2011)
Feldman, M., Svensson, O., Zenklusen, R.: A simple O(log log(rank))-competitive algorithm for the matroid secretary problem. In: SODA 2015, pp. 1189–1201. SIAM (2015)
Freeman, P.R.: The secretary problem and its extensions: A review. International Statistical Review / Revue Internationale de Statistique 51(2), 189–206 (1983)
Gallego, G., van Ryzin, G.: Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Manage. Sci. 40(8), 999–1020 (1994)
Göbel, O., Hoefer, M., Kesselheim, T., Schleiden, T., Vöcking, B.: Online independent set beyond the worst-case: Secretaries, prophets, and periods. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 508–519. Springer, Heidelberg (2014)
Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC 2004, pp. 71–80 (2004)
Hajiaghayi, M.T., Kleinberg, R.D., Mahdian, M., Parkes, D.C.: Online auctions with re-usable goods. In: EC 2005, pp. 165–174 (2005)
Justicz, J., Scheinerman, E.R., Winkler, P.M.: Random intervals. The American Mathematical Monthly 97(10), 881–889 (1990)
Karlin, S.: Stochastic models and optimal policy for selling an asset, pp. 148–158 (1962)
Kesselheim, T., Radke, K., Tönnis, A., Vöcking, B.: An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 589–600. Springer, Heidelberg (2013)
Kesselheim, T., Tönnis, A., Radke, K., Vöcking, B.: Primal beats dual on online packing lps in the random-order model. In: STOC 2014, pp. 303–312. ACM (2014)
Kleinberg, R.D.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA 2005, pp. 630–631. SIAM (2005)
Korula, N., Pál, M.: Algorithms for secretary problems on graphs and hypergraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 508–520. Springer, Heidelberg (2009)
Lachish, O.: O(log log rank) competitive-ratio for the matroid secretary problem. CoRR, abs/1403.7343 (2014)
Lindley, D.V.: Dynamic programming and decision theory. Appl. Statist., 39–52 (1961)
Lipton, R.: Online interval scheduling. In: SODA 1994, pp. 302–311 (1994)
Singer, Y., Mittal, M.: Pricing mechanisms for crowdsourcing markets. In: WWW 2013, pp. 1157–1166 (2013)
Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science 130(1), 5–16 (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fiat, A., Gorelik, I., Kaplan, H., Novgorodov, S. (2015). The Temp Secretary Problem. In: Bansal, N., Finocchi, I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science(), vol 9294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48350-3_53
Download citation
DOI: https://doi.org/10.1007/978-3-662-48350-3_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48349-7
Online ISBN: 978-3-662-48350-3
eBook Packages: Computer ScienceComputer Science (R0)