{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:55:38Z","timestamp":1725828938192},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_53","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T21:40:34Z","timestamp":1441057234000},"page":"631-642","source":"Crossref","is-referenced-by-count":4,"title":["The Temp Secretary Problem"],"prefix":"10.1007","author":[{"given":"Amos","family":"Fiat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilia","family":"Gorelik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slava","family":"Novgorodov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: Weights and discounts. In: SODA 2009, pp. 1245\u20131254 (2009)","DOI":"10.1137\/1.9781611973068.135"},{"key":"53_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-74208-1_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Babaioff","year":"2007","unstructured":"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.\u00a04627, pp. 16\u201328. Springer, Heidelberg (2007)"},{"issue":"2","key":"53_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1399589.1399596","volume":"7","author":"M. Babaioff","year":"2008","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exch.\u00a07(2), 1\u201311 (2008)","journal-title":"SIGecom Exch."},{"key":"53_CR4","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA 2007, pp. 434\u2013443. SIAM (2007)"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Kleinberg, R., Singer, Y.: Learning on a budget: Posted price mechanisms for online procurement. In: EC 2012, pp. 128\u2013145 (2012)","DOI":"10.1145\/2229012.2229026"},{"key":"53_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1017\/S0963548301004813","volume":"10","author":"S. Boucheron","year":"2001","unstructured":"Boucheron, S., Fernandez de la Vega, W.: On the independence number of random interval graphs. Combinatorics, Probability and Computing\u00a010, 385\u2013396 (2001)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"3","key":"53_CR7","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1214\/aop\/1176993237","volume":"12","author":"F. Thomas Bruss","year":"1984","unstructured":"Thomas Bruss, F.: A unified approach to a class of best choice problems with an unknown number of options. Ann. Probab.\u00a012(3), 882\u2013889 (1984)","journal-title":"Ann. Probab."},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Lachish, O.: Improved competitive ratio for the matroid secretary problem. In: SODA 2012, pp. 1702\u20131712. SIAM (2012)","DOI":"10.1137\/1.9781611973099.135"},{"issue":"1","key":"53_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF01295224","volume":"102","author":"E.G. Coffman Jr.","year":"1995","unstructured":"Coffman Jr., E.G., Poonen, B., Winkler, P.: Packing random intervals. Probability Theory and Related Fields\u00a0102(1), 105\u2013121 (1995)","journal-title":"Probability Theory and Related Fields"},{"key":"53_CR10","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: EC 2009, pp. 71\u201378 (2009)","DOI":"10.1145\/1566374.1566384"},{"issue":"2","key":"53_CR11","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1145\/2491533.2491557","volume":"44","author":"M. Dinitz","year":"2013","unstructured":"Dinitz, M.: Recent advances on the matroid secretary problem. SIGACT News\u00a044(2), 126\u2013142 (2013)","journal-title":"SIGACT News"},{"key":"53_CR12","unstructured":"Dynkin, E.B.: The optimal choice of the stopping moment for a markov process. Dokl. Akad. Nauk. SSSR, 238\u2013240 (1963)"},{"key":"53_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-22935-0_19","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Feldman","year":"2011","unstructured":"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.\u00a06845, pp. 218\u2013229. Springer, Heidelberg (2011)"},{"key":"53_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.: A simple O(log log(rank))-competitive algorithm for the matroid secretary problem. In: SODA 2015, pp. 1189\u20131201. SIAM (2015)","DOI":"10.1137\/1.9781611973730.79"},{"issue":"2","key":"53_CR15","first-page":"189","volume":"51","author":"P.R. Freeman","year":"1983","unstructured":"Freeman, P.R.: The secretary problem and its extensions: A review. International Statistical Review \/ Revue Internationale de Statistique\u00a051(2), 189\u2013206 (1983)","journal-title":"International Statistical Review \/ Revue Internationale de Statistique"},{"issue":"8","key":"53_CR16","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1287\/mnsc.40.8.999","volume":"40","author":"G. Gallego","year":"1994","unstructured":"Gallego, G., van Ryzin, G.: Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Manage. Sci.\u00a040(8), 999\u20131020 (1994)","journal-title":"Manage. Sci."},{"key":"53_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1007\/978-3-662-43951-7_43","volume-title":"Automata, Languages, and Programming","author":"O. G\u00f6bel","year":"2014","unstructured":"G\u00f6bel, O., Hoefer, M., Kesselheim, T., Schleiden, T., V\u00f6cking, 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.\u00a08573, pp. 508\u2013519. Springer, Heidelberg (2014)"},{"key":"53_CR18","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC 2004, pp. 71\u201380 (2004)","DOI":"10.1145\/988772.988784"},{"key":"53_CR19","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R.D., Mahdian, M., Parkes, D.C.: Online auctions with re-usable goods. In: EC 2005, pp. 165\u2013174 (2005)","DOI":"10.1145\/1064009.1064027"},{"issue":"10","key":"53_CR20","doi-asserted-by":"publisher","first-page":"881","DOI":"10.2307\/2324324","volume":"97","author":"J. Justicz","year":"1990","unstructured":"Justicz, J., Scheinerman, E.R., Winkler, P.M.: Random intervals. The American Mathematical Monthly\u00a097(10), 881\u2013889 (1990)","journal-title":"The American Mathematical Monthly"},{"key":"53_CR21","unstructured":"Karlin, S.: Stochastic models and optimal policy for selling an asset, pp. 148\u2013158 (1962)"},{"key":"53_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-642-40450-4_50","volume-title":"Algorithms \u2013 ESA 2013","author":"T. Kesselheim","year":"2013","unstructured":"Kesselheim, T., Radke, K., T\u00f6nnis, A., V\u00f6cking, 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.\u00a08125, pp. 589\u2013600. Springer, Heidelberg (2013)"},{"key":"53_CR23","doi-asserted-by":"crossref","unstructured":"Kesselheim, T., T\u00f6nnis, A., Radke, K., V\u00f6cking, B.: Primal beats dual on online packing lps in the random-order model. In: STOC 2014, pp. 303\u2013312. ACM (2014)","DOI":"10.1145\/2591796.2591810"},{"key":"53_CR24","unstructured":"Kleinberg, R.D.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA 2005, pp. 630\u2013631. SIAM (2005)"},{"key":"53_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-02930-1_42","volume-title":"Automata, Languages and Programming","author":"N. Korula","year":"2009","unstructured":"Korula, N., P\u00e1l, 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.\u00a05556, pp. 508\u2013520. Springer, Heidelberg (2009)"},{"key":"53_CR26","doi-asserted-by":"crossref","unstructured":"Lachish, O.: O(log log rank) competitive-ratio for the matroid secretary problem. CoRR, abs\/1403.7343 (2014)","DOI":"10.1109\/FOCS.2014.42"},{"key":"53_CR27","doi-asserted-by":"crossref","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. Appl. Statist., 39\u201352 (1961)","DOI":"10.2307\/2985407"},{"key":"53_CR28","unstructured":"Lipton, R.: Online interval scheduling. In: SODA 1994, pp. 302\u2013311 (1994)"},{"key":"53_CR29","doi-asserted-by":"crossref","unstructured":"Singer, Y., Mittal, M.: Pricing mechanisms for crowdsourcing markets. In: WWW 2013, pp. 1157\u20131166 (2013)","DOI":"10.1145\/2488388.2488489"},{"issue":"1","key":"53_CR30","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"G.J. Woeginger","year":"1994","unstructured":"Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science\u00a0130(1), 5\u201316 (1994)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:24Z","timestamp":1559231904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}