{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:30:53Z","timestamp":1778499053068,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2213991","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"123-136","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":113,"title":["Matroid prophet inequalities"],"prefix":"10.1145","author":[{"given":"Robert","family":"Kleinberg","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Seth Matthew","family":"Weinberg","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.90"},{"key":"e_1_3_2_2_2_1","volume-title":"ICALP 2009, Rhodes, greece, July 5--12, 2009, Proceedings, Part II","volume":"5556","author":"Albers Susanne","year":"2009"},{"key":"e_1_3_2_2_3_1","first-page":"434","volume-title":"Proc. 18th ACM Symp. on Discrete Algorithms","author":"Babaioff Moshe","year":"2007"},{"key":"e_1_3_2_2_4_1","unstructured":"Sourav Chakraborty and Oded Lachish. Improved competitive ratio for the matroid secretary problem. In SODA12. to appear.   Sourav Chakraborty and Oded Lachish. Improved competitive ratio for the matroid secretary problem. In SODA12. to appear."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.15"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_33"},{"key":"e_1_3_2_2_8_1","first-page":"225","volume-title":"Proc. 19th Annual European Symposium on Algorithms","author":"Gharan Shayan Oveis","year":"2011"},{"key":"e_1_3_2_2_9_1","first-page":"18","volume-title":"SODA","author":"Goel Ashish","year":"2009"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_41"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1870103.1870106"},{"key":"e_1_3_2_2_12_1","first-page":"58","volume-title":"Proc. 22nd AAAI Conference on Artificial Intelligence","author":"Hajiaghayi MohammadTaghi","year":"2007"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993009"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4149(87)90029-9"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/1427302"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_42"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_2_18_1","first-page":"197","article-title":"On semiamarts, amarts, and processes with finite value","volume":"4","author":"Krengel Ulrich","year":"1978","journal-title":"Adv. in Prob. Related Topics"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_3_2_2_21_1","unstructured":"Alexander Schrijver. Combinatorial Optimization volume B. Springer 2003.  Alexander Schrijver. Combinatorial Optimization volume B. Springer 2003."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133133"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2213991","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2213991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2213991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":22,"alternative-id":["10.1145\/2213977.2213991","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2213991","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}