{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:42:30Z","timestamp":1762101750532},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_42","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T21:40:34Z","timestamp":1441057234000},"page":"496-508","source":"Crossref","is-referenced-by-count":8,"title":["Prophet Secretary"],"prefix":"10.1007","author":[{"given":"Hossein","family":"Esfandiari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MohammadTaghi","family":"Hajiaghayi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahid","family":"Liaghat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Monemizadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"issue":"1","key":"42_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480195290017","volume":"14","author":"M. Ajtai","year":"2001","unstructured":"Ajtai, M., Megiddo, N., Waarts, O.: Improved algorithms and analysis for secretary problems and generalizations. SIAM J. Discrete Math.\u00a014(1), 1\u201327 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Hajiaghayi, M., Liaghat, V.: Online prophet-inequality matching with applications to ad allocation. In: EC (2012)","DOI":"10.1145\/2229012.2229018"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-40328-6_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Alaei","year":"2013","unstructured":"Alaei, S., Hajiaghayi, M., Liaghat, V.: The online stochastic generalized assignment problem. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) RANDOM 2013 and APPROX 2013. LNCS, vol.\u00a08096, pp. 11\u201325. Springer, Heidelberg (2013)"},{"key":"42_CR4","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.: 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":"42_CR5","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":"42_CR6","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA, pp. 434\u2013443 (2007)"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J., Malec, D., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing (2010)","DOI":"10.1145\/1807406.1807428"},{"key":"42_CR8","first-page":"627","volume":"4","author":"E.B. Dynkin","year":"1963","unstructured":"Dynkin, E.B.: The optimum choice of the instant for stopping a markov process. Sov. Math. Dokl.\u00a04, 627\u2013629 (1963)","journal-title":"Sov. Math. Dokl."},{"issue":"3","key":"42_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1080\/07474948308836035","volume":"2","author":"K.S. Glasser","year":"1983","unstructured":"Glasser, K.S., Holzsager, R., Barron, A.: The d choice secretary problem. Comm. Statist. C\u2014Sequential Anal.\u00a02(3), 177\u2013199 (1983)","journal-title":"Comm. Statist. C\u2014Sequential Anal."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC, pp. 71\u201380 (2004)","DOI":"10.1145\/988772.988784"},{"key":"42_CR11","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: AAAI, pp. 58\u201365 (2007)"},{"key":"42_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/11944874_35","volume-title":"Internet and Network Economics","author":"N. Immorlica","year":"2006","unstructured":"Immorlica, N., Kleinberg, R.D., Mahdian, M.: Secretary problems with competing employers. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 389\u2013400. Springer, Heidelberg (2006)"},{"key":"42_CR13","unstructured":"Kennedy, D.P.: Prophet-type inequalities for multi-choice optimal stopping. In: Stoch. Proc. Applic. (1978)"},{"key":"42_CR14","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA, pp. 630\u2013631 (2005)"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: STOC (2012)","DOI":"10.1145\/2213977.2213991"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Krengel, U., Sucheston, L.: Semiamarts and finite values. Bull. Am. Math. Soc. (1977)","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"42_CR17","unstructured":"Krengel, U., Sucheston, L.: On semiamarts, amarts, and processes with finite value. In: Kuelbs, J. (ed.) Probability on Banach Spaces (1978)"},{"issue":"1","key":"42_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R.B. Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Mathematics of Operations Research\u00a06(1), 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"42_CR19","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1287\/moor.5.4.481","volume":"5","author":"R.J. Vanderbei","year":"1980","unstructured":"Vanderbei, R.J.: The optimal choice of a subset of a population. Math. Oper. Res.\u00a05(4), 481\u2013486 (1980)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"42_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-4149(91)90086-R","volume":"39","author":"J.G. Wilson","year":"1991","unstructured":"Wilson, J.G.: Optimal choice and assignment of the best m of n randomly arriving items. Stochastic Process. Appl.\u00a039(2), 325\u2013343 (1991)","journal-title":"Stochastic Process. Appl."},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Yan, Q.: Mechanism design via correlation gap. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, pp. 710\u2013719 (2011)","DOI":"10.1137\/1.9781611973082.56"}],"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_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:59:27Z","timestamp":1559231967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}