{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T17:47:30Z","timestamp":1744048050835},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642366932"},{"type":"electronic","value":"9783642366949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36694-9_22","type":"book-chapter","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T06:08:39Z","timestamp":1362982119000},"page":"254-265","source":"Crossref","is-referenced-by-count":14,"title":["Advances on Matroid Secretary Problems: Free Order Model and Laminar Case"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Jaillet","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 A.","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Rico","family":"Zenklusen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn. John Wiley & Sons (2008)","DOI":"10.1002\/9780470277331"},{"key":"22_CR2","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 434\u2013443 (2007)"},{"key":"22_CR3","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. Bateni","year":"2010","unstructured":"Bateni, M., Hajiaghayi, M., Zadimoghaddam, M.: Submodular Secretary Problem and Extensions. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010. LNCS, vol.\u00a06302, pp. 39\u201352. Springer, Heidelberg (2010)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Lachish, O.: Improved competitive ratio for the matroid secretary problem. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1702\u20131712 (2012)","DOI":"10.1137\/1.9781611973099.135"},{"key":"22_CR5","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":"22_CR6","unstructured":"Dynkin, E.B.: The optimum choice of the instant for stopping a markov process. Soviet Mathematics, Doklady\u00a04 (1963)"},{"key":"22_CR7","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.) APPROX\/RANDOM 2011. LNCS, vol.\u00a06845, pp. 218\u2013229. Springer, Heidelberg (2011)"},{"issue":"3","key":"22_CR8","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\u2013296 (1989)","journal-title":"Statistical Science"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1038\/scientificamerican0260-150","volume":"202","author":"M. Gardner","year":"1960","unstructured":"Gardner, M.: Mathematical games column. Scientific American\u00a0202(2), 150\u2013154 (1960)","journal-title":"Scientific American"},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1038\/scientificamerican0360-172","volume":"202","author":"M. Gardner","year":"1960","unstructured":"Gardner, M.: Mathematical games column. Scientific American\u00a0202(3), 172\u2013182 (1960)","journal-title":"Scientific American"},{"key":"22_CR11","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":"22_CR12","doi-asserted-by":"crossref","unstructured":"Im, S., Wang, Y.: Secretary problems: Laminar matroid and interval scheduling. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1265\u20131274 (2011)","DOI":"10.1137\/1.9781611973082.96"},{"key":"22_CR13","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 630\u2013631 (2005)"},{"key":"22_CR14","unstructured":"Kleinberg, R.: Personal Communication (2012)"},{"key":"22_CR15","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)"},{"issue":"1","key":"22_CR16","first-page":"39","volume":"10","author":"D.V. Lindley","year":"1961","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. Journal of the Royal Statistical Society. Series C (Applied Statistics)\u00a010(1), 39\u201351 (1961)","journal-title":"Journal of the Royal Statistical Society. Series C (Applied Statistics)"},{"key":"22_CR17","unstructured":"Ma, T., Tang, B., Wang, Y.: The simulated greedy algorithm for several submodular matroid secretary problems. CoRR, abs\/1107.2188v2 (2012)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-23719-5_29","volume-title":"Algorithms \u2013 ESA 2011","author":"S. Oveis Gharan","year":"2011","unstructured":"Oveis Gharan, S., Vondr\u00e1k, J.: On Variants of the Matroid Secretary Problem. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 335\u2013346. Springer, Heidelberg (2011)"},{"key":"22_CR19","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer (2003)"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Soto, J.A.: Matroid secretary problem in the random assignment model. In: Proceedings of the 22nd Annual ACM -SIAM Symposium on Discrete Algorithms, SODA, pp. 1275\u20131284 (2011)","DOI":"10.1137\/1.9781611973082.97"},{"issue":"3","key":"22_CR21","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08(3), 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36694-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T13:33:31Z","timestamp":1557581611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36694-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366932","9783642366949"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36694-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}