{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:36:04Z","timestamp":1760056564894,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031931116"},{"type":"electronic","value":"9783031931123"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-93112-3_10","type":"book-chapter","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T04:56:09Z","timestamp":1749531369000},"page":"128-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Matroid Secretary via\u00a0Labeling Schemes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0457-4573","authenticated-orcid":false,"given":"Krist\u00f3f","family":"B\u00e9rczi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3425-0409","authenticated-orcid":false,"given":"Vasilis","family":"Livanos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2219-8401","authenticated-orcid":false,"given":"Jos\u00e9 A.","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0817-7356","authenticated-orcid":false,"given":"Victor","family":"Verdugo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,4]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: SODA, pp. 1245\u20131254 (2009)","DOI":"10.1137\/1.9781611973068.135"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Matroid secretary problems. J. ACM 65(6) (2018)","DOI":"10.1145\/3212512"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2500121","volume":"9","author":"M Bateni","year":"2013","unstructured":"Bateni, M., Hajiaghayi, M., Zadimoghaddam, M.: Submodular secretary problem and extensions. ACM Trans. Algorithms 9(4), 1\u201323 (2013)","journal-title":"ACM Trans. Algorithms"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Lachish, O.: Improved competitive ratio for the matroid secretary problem. In: SODA, pp. 1702\u20131712 (2012)","DOI":"10.1137\/1.9781611973099.135"},{"key":"10_CR5","unstructured":"Cristi, A., D\u00fctting, P., Kleinberg, R., Leme, R.P.: Online matroid embeddings (2024). https:\/\/arxiv.org\/abs\/2407.10316"},{"issue":"5","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.1137\/13094030X","volume":"43","author":"M Dinitz","year":"2014","unstructured":"Dinitz, M., Kortsarz, G.: Matroid secretary for regular and decomposable matroids. SIAM J. Comput. 43(5), 1807\u20131830 (2014)","journal-title":"SIAM J. Comput."},{"key":"10_CR7","unstructured":"Dughmi, S.: The outer limits of contention resolution on matroids and connections to the secretary problem. In: ICALP, pp. 42:1\u201342:18 (2020)"},{"key":"10_CR8","unstructured":"Dughmi, S.: Matroid secretary is equivalent to contention resolution. In: ITCS, pp. 58:1\u201358:23 (2022)"},{"key":"10_CR9","unstructured":"Dynkin, E.B.: The optimum choice of the instant for stopping a Markov process. Soviet Math. Dokl 4 (1963)"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1287\/moor.2017.0876","volume":"43","author":"M Feldman","year":"2018","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.: A simple O(log log(rank))-competitive algorithm for the matroid secretary problem. Math. Oper. Res. 43(2), 638\u2013650 (2018)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/S00453-013-9795-Y","volume":"67","author":"SO Gharan","year":"2013","unstructured":"Gharan, S.O., Vondr\u00e1k, J.: On variants of the matroid secretary problem. Algorithmica 67(4), 472\u2013497 (2013). https:\/\/doi.org\/10.1007\/S00453-013-9795-Y","journal-title":"Algorithmica"},{"key":"10_CR12","unstructured":"Huang, Z., Parsaeian, Z., Zhu, Z.: Laminar matroid secretary: greedy strikes back. To appear in ESA (2024)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Im, S., Wang, Y.: Secretary problems: laminar matroid and interval scheduling. In: SODA, pp. 1265\u20131274 (2011)","DOI":"10.1137\/1.9781611973082.96"},{"key":"10_CR14","doi-asserted-by":"crossref","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: ESA, pp. 589\u2013600 (2013)","DOI":"10.1007\/978-3-642-40450-4_50"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Korula, N., P\u00e1l, M.: Algorithms for secretary problems on graphs and hypergraphs. In: ICALP (2009)","DOI":"10.1007\/978-3-642-02930-1_42"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Lachish, O.: O(log log rank) competitive ratio for the matroid secretary problem. In: FOCS, pp. 326\u2013335 (2014)","DOI":"10.1109\/FOCS.2014.42"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. J. R. Stat. Soc. Ser. C (Appl. Stat.) 10(1), 39\u201351 (1961)","DOI":"10.2307\/2985407"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Santiago, R., Sergeev, I., Zenklusen, R.: Constant-competitiveness for random assignment matroid secretary without knowing the matroid. In: IPCO, pp. 423\u2013437 (2023). https:\/\/doi.org\/10.1007\/978-3-031-32726-1_30","DOI":"10.1007\/978-3-031-32726-1_30"},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/110852061","volume":"42","author":"JA Soto","year":"2013","unstructured":"Soto, J.A.: Matroid secretary problem in the random-assignment model. SIAM J. Comput. 42(1), 178\u2013211 (2013)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1287\/moor.2020.1083","volume":"46","author":"JA Soto","year":"2021","unstructured":"Soto, J.A., Turkieltaub, A., Verdugo, V.: Strong algorithms for the ordinal matroid secretary problem. Math. Oper. Res. 46(2), 642\u2013673 (2021)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-93112-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T10:53:19Z","timestamp":1760007199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93112-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031931116","9783031931123"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93112-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baltimore, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco25.cs.jhu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}