{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T22:41:43Z","timestamp":1789425703612,"version":"build-2803163510"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,8,24]],"date-time":"2013-08-24T00:00:00Z","timestamp":1377302400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s00453-013-9795-y","type":"journal-article","created":{"date-parts":[[2013,8,23]],"date-time":"2013-08-23T10:05:03Z","timestamp":1377252303000},"page":"472-497","source":"Crossref","is-referenced-by-count":13,"title":["On Variants of the Matroid Secretary Problem"],"prefix":"10.1007","volume":"67","author":[{"given":"Shayan","family":"Oveis\u00a0Gharan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Vondr\u00e1k","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,24]]},"reference":[{"key":"9795_CR1","doi-asserted-by":"crossref","first-page":"619","DOI":"10.2307\/3213519","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. Probab. 19, 619\u2013630 (1982)","journal-title":"J. Appl. Probab."},{"key":"9795_CR2","first-page":"1245","volume-title":"SODA 2009","author":"M. Babaioff","year":"2009","unstructured":"Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: SODA 2009, pp.\u00a01245\u20131254 (2009)"},{"key":"9795_CR3","first-page":"434","volume-title":"SODA 2007","author":"M. Babaioff","year":"2007","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA 2007, pp.\u00a0434\u2013443 (2007)"},{"key":"9795_CR4","first-page":"39","volume-title":"APPROX 2010","author":"M.H. Bateni","year":"2010","unstructured":"Bateni, M.H., Hajiaghayi, M.T., Zadimoghaddam, M.: Submodular secretary problem and extensions. In: APPROX 2010, pp.\u00a039\u201352 (2010)"},{"key":"9795_CR5","unstructured":"Borosan, P., Shabbir, M.: A survey of secretary problem and its extensions. Unpublished manuscript (2009). Available at. http:\/\/paul.rutgers.edu\/~mudassir\/Secretary\/paper.pdf"},{"key":"9795_CR6","first-page":"163","volume-title":"IPCO 2010","author":"N. Buchbinder","year":"2010","unstructured":"Buchbinder, N., Jain, K., Singh, M.: Secretary problems via linear programming. In: IPCO 2010, pp.\u00a0163\u2013176 (2010)"},{"key":"9795_CR7","first-page":"1702","volume-title":"SODA 2012","author":"S. Chakraborty","year":"2012","unstructured":"Chakraborty, S., Lachish, O.: Improved competitive ratio for the matroid secretary problem. In: SODA 2012, pp.\u00a01702\u20131712 (2012)"},{"key":"9795_CR8","first-page":"397","volume-title":"ICALP 2008","author":"N.B. Dimitrov","year":"2008","unstructured":"Dimitrov, N.B., Plaxton, C.G.: Competitive weighted matching in transversal matroids. In: ICALP 2008, pp.\u00a0397\u2013408 (2008)"},{"key":"9795_CR9","unstructured":"Dynkin, E.B.: The optimum choice of the instant for stopping a Markov process. Sov. Math. Dokl. 4 (1963)"},{"key":"9795_CR10","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-642-15775-2_16","volume-title":"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: ESA 2010, pp.\u00a0182\u2013194 (2010)"},{"issue":"3","key":"9795_CR11","doi-asserted-by":"crossref","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? Stat. Sci. 4(3), 282\u2013289 (1989)","journal-title":"Stat. Sci."},{"key":"9795_CR12","doi-asserted-by":"crossref","unstructured":"Gardner, M.: Mathematical games column. Sci. Am. February (1960)","DOI":"10.1038\/scientificamerican0760-154"},{"key":"9795_CR13","doi-asserted-by":"crossref","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. Am. Stat. Soc. 61, 35\u201373 (1966)","journal-title":"J. Am. Stat. Soc."},{"key":"9795_CR14","first-page":"246","volume-title":"WINE 2010","author":"A. Gupta","year":"2010","unstructured":"Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: offline and secretary algorithms. In: WINE 2010, pp.\u00a0246\u2013257 (2010)"},{"key":"9795_CR15","first-page":"71","volume-title":"EC 2004","author":"M.T. Hajiaghayi","year":"2004","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.: Adaptive limited-supply online auctions. In: EC 2004, pp.\u00a071\u201380 (2004)"},{"key":"9795_CR16","first-page":"58","volume-title":"ICAI 2007","author":"M.T. Hajiaghayi","year":"2007","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: ICAI 2007, pp.\u00a058\u201365 (2007)"},{"key":"9795_CR17","first-page":"1265","volume-title":"SODA 2011","author":"S. Im","year":"2011","unstructured":"Im, S., Wang, Y.: Secretary problems: laminar matroid and interval scheduling. In: SODA 2011, pp.\u00a01265\u20131274 (2011)"},{"issue":"1","key":"9795_CR18","first-page":"39","volume":"10","author":"D.V. Lindley","year":"1961","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. J. R. Stat. Soc., Ser. C, Appl. Stat. 10(1), 39\u201351 (1961)","journal-title":"J. R. Stat. Soc., Ser. C, Appl. Stat."},{"key":"9795_CR19","first-page":"630","volume-title":"SODA 2005","author":"R. Kleinberg","year":"2005","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA 2005, pp.\u00a0630\u2013631 (2005)"},{"key":"9795_CR20","first-page":"508","volume-title":"ICALP 2009","author":"N. Korula","year":"2009","unstructured":"Korula, N., P\u00e1l, M.: Algorithms for secretary problems on graphs and hypergraphs. In: ICALP 2009, pp.\u00a0508\u2013520 (2009)"},{"key":"9795_CR21","first-page":"1275","volume-title":"SODA 2011","author":"J.A. Soto","year":"2011","unstructured":"Soto, J.A.: Matroid secretary problem in the random assignment model. In: SODA 2011, pp.\u00a01275\u20131284 (2011)"},{"key":"9795_CR22","unstructured":"Soto, J.: Contributions on secretary problems, independent sets of rectangles and related problems. Ph.D. Thesis, Department of Mathematics, Massachusetts Institute of Technology (2011)"},{"issue":"1","key":"9795_CR23","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.29.1.130","volume":"29","author":"T.J. Stewart","year":"1981","unstructured":"Stewart, T.J.: The secretary problem with an unknown number of options. Oper. Res. 29(1), 130\u2013145 (1981)","journal-title":"Oper. Res."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9795-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9795-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9795-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,21]],"date-time":"2019-07-21T16:01:09Z","timestamp":1563724869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9795-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,24]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9795"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9795-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,24]]}}}