{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:18Z","timestamp":1725603678874},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_29","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"335-346","source":"Crossref","is-referenced-by-count":3,"title":["On Variants of the Matroid Secretary Problem"],"prefix":"10.1007","author":[{"given":"Shayan","family":"Oveis Gharan","sequence":"first","affiliation":[]},{"given":"Jan","family":"Vondr\u00e1k","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1017\/S0021900200037104","volume":"19","author":"A.R. Abdel-Hamid","year":"1982","unstructured":"Abdel-Hamid, A.R., Bather, J.A., Trustrum, G.B.: The secretary problem with an unknown number of candidates. J. Appl. Prob.\u00a019, 619\u2013630 (1982)","journal-title":"J. Appl. Prob."},{"key":"29_CR2","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":"29_CR3","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA 2007, pp. 434\u2013443 (2007)"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-15369-3_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M.H. Bateni","year":"2010","unstructured":"Bateni, M.H., Hajiaghayi, M.T., Zadimoghaddam, M.: Submodular secretary problem and extensions. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX 2010, LNCS, vol.\u00a06302, pp. 39\u201352. Springer, Heidelberg (2010)"},{"key":"29_CR5","unstructured":"Borosan, P., Shabbir, M.: A survey of secretary problem and its extensions (preprint 2009), http:\/\/paul.rutgers.edu\/~mudassir\/Secretary\/paper.pdf"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-13036-6_13","volume-title":"Integer Programming and Combinatorial Optimization","author":"N. Buchbinder","year":"2010","unstructured":"Buchbinder, N., Jain, K., Singh, M.: Secretary problems via linear programming. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 163\u2013176. Springer, Heidelberg (2010)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-70575-8_33","volume-title":"Automata, Languages and Programming","author":"N.B. Dimitrov","year":"2008","unstructured":"Dimitrov, N.B., Plaxton, C.G.: Competitive weighted matching in transversal matroids. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 397\u2013408. Springer, Heidelberg (2008)"},{"key":"29_CR8","unstructured":"Dynkin, E.B.: The optimum choice of the instant for stopping a markov process. Soviet Mathematics, Doklady 4 (1963)"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15775-2_16","volume-title":"Algorithms \u2013 ESA 2010","author":"J. Feldman","year":"2010","unstructured":"Feldman, J., Henzinger, M., Korula, N., Mirrokni, V.S., Stein, C.: Online stochastic packing applied to display ad allocation. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 182\u2013194. Springer, Heidelberg (2010)"},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"T.S. Ferguson","year":"1989","unstructured":"Ferguson, T.S.: Who solved the secretary problem? Statistical Science\u00a04(3), 282\u2013289 (1989)","journal-title":"Statistical Science"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Gardner, M.: Mathematical Games column. Scientific American (February 1960)","DOI":"10.1038\/scientificamerican0160-150"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/01621459.1966.10502008","volume":"61","author":"J. Gilbert","year":"1966","unstructured":"Gilbert, J., Mosteller, F.: Recognizing the maximum of a sequence. J. Amer. Statist. Assoc.\u00a061, 35\u201373 (1966)","journal-title":"J. Amer. Statist. Assoc."},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-17572-5_20","volume-title":"Internet and Network Economics","author":"A. Gupta","year":"2010","unstructured":"Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: Offline and secretary algorithms. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 246\u2013257. Springer, Heidelberg (2010)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.: Adaptive limited-supply online auctions. In: EC 2004, pp. 71\u201380 (2004)","DOI":"10.1145\/988772.988784"},{"key":"29_CR15","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: International Conference on Artificial Intelligence 2007, pp. 58\u201365 (2007)"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Im, S., Wang, Y.: Secretary problems: Laminar matroid and interval scheduling. In: SODA 2011, pp. 1265\u20131274 (2011)","DOI":"10.1137\/1.9781611973082.96"},{"key":"29_CR17","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. Journal of the Royal Statistical Society. Series C (Applied Statistics) 10(1), 39\u201351 (1961)"},{"key":"29_CR18","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA 2005, pp. 630\u2013631 (2005)"},{"key":"29_CR19","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. LNCS, vol.\u00a05556, pp. 508\u2013520. Springer, Heidelberg (2009)"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Soto, J.A.: Matroid secretary problem in the random assignment model. In: SODA 2011, pp. 1275\u20131284 (2011)","DOI":"10.1137\/1.9781611973082.97"},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.29.1.130","volume":"1","author":"T.J. Stewart","year":"1981","unstructured":"Stewart, T.J.: The secretary problem with an unknown number of options. Operations Research\u00a01, 130\u2013145 (1981)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:08:47Z","timestamp":1560514127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}