{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:02:00Z","timestamp":1778270520846,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["2127781"],"award-info":[{"award-number":["2127781"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649786","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1247-1258","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Prophet Inequalities with Cancellation Costs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4456-0492","authenticated-orcid":false,"given":"Farbod","family":"Ekbatani","sequence":"first","affiliation":[{"name":"University of Chicago, Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5880-6221","authenticated-orcid":false,"given":"Rad","family":"Niazadeh","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9423-4486","authenticated-orcid":false,"given":"Pranav","family":"Nuti","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6021-679X","authenticated-orcid":false,"given":"Jan","family":"Vondr\u00e1k","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055479"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00080"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0114"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/120878422"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229018"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329652"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1014843085"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777438"},{"key":"e_1_3_2_1_9_1","volume-title":"Fourth workshop on ad auctions.","author":"Babaioff Moshe","year":"2008","unstructured":"Moshe Babaioff, Jason Hartline, and Robert Kleinberg. 2008. Selling banner ads: Online algorithms with buyback. In Fourth workshop on ad auctions."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Ashwinkumar Badanidiyuru. 2011. Buyback problem-approximate matroid intersection with cancellation costs. In International Colloquium on Automata Languages and Programming. 379\u2013390.","DOI":"10.1007\/978-3-642-22006-7_32"},{"key":"e_1_3_2_1_11_1","volume-title":"International Workshop on Internet and Network Economics. 529\u2013536","author":"Badanidiyuru Ashwinkumar","year":"2009","unstructured":"Ashwinkumar Badanidiyuru and Robert Kleinberg. 2009. Randomized online algorithms for the buyback problem. In International Workshop on Internet and Network Economics. 529\u2013536."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1954-09848-8"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. 1202\u20131216","author":"Buchbinder Niv","year":"2014","unstructured":"Niv Buchbinder, Moran Feldman, and Roy Schwartz. 2014. Online submodular maximization with preemption. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. 1202\u20131216."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225278"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062016"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the forty-third annual ACM symposium on Theory of computing. 783\u2013792","author":"Chekuri Chandra","year":"2011","unstructured":"Chandra Chekuri, Jan Vondr\u00e1k, and Rico Zenklusen. 2011. Submodular function maximization via the multilinear relaxation and contention resolution schemes. In Proceedings of the forty-third annual ACM symposium on Theory of computing. 783\u2013792."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.137"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085137"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331033.3331039"},{"key":"e_1_3_2_1_21_1","unstructured":"Atanas Dinev and S Matthew Weinberg. 2023. Simple and Optimal Online Contention Resolution Schemes for k -Uniform Matroids. arXiv preprint arXiv:2309.10078."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323850"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Farbod Ekbatani Yiding Feng and Rad Niazadeh. 2022. Online Matching with Cancellation Costs. arXiv preprint arXiv:2210.11570.","DOI":"10.2139\/ssrn.4245468"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Farbod Ekbatani Rad Niazadeh Pranav Nuti and Jan Vondrak. 2024. Prophet Inequalities with Cancellation Costs. arxiv:2404.00527.","DOI":"10.1145\/3618260.3649786"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Farbod Ekbatani Rad Niazadeh Pranav Nuti and Jan Vondr\u00e1k. 2024. Prophet Inequalities with Cancellation Costs. https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=4779633","DOI":"10.1145\/3618260.3649786"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1029394"},{"key":"e_1_3_2_1_27_1","unstructured":"Tomer Ezra Michal Feldman Nick Gravin and Zhihao Gavin Tang. 2022. On the Significance of Knowing the Arrival Order in Prophet Inequality.. arXiv preprint arXiv:2202.09215."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1152"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219211"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132523"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9314"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488634"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538320"},{"key":"e_1_3_2_1_35_1","first-page":"58","article-title":"Automated online mechanism design and prophet inequalities","volume":"7","author":"Hajiaghayi Mohammad Taghi","year":"2007","unstructured":"Mohammad Taghi Hajiaghayi, Robert Kleinberg, and Tuomas Sandholm. 2007. Automated online mechanism design and prophet inequalities. In AAAI. 7, 58\u201365.","journal-title":"AAAI."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9822-z"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566407"},{"key":"e_1_3_2_1_38_1","first-page":"336","article-title":"Comparisons of stop rule and supremum expectations of iid random variables","author":"Hill Theodore P","year":"1982","unstructured":"Theodore P Hill and Robert P Kertz. 1982. Comparisons of stop rule and supremum expectations of iid random variables. The Annals of Probability, 336\u2013345.","journal-title":"The Annals of Probability"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399452"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.51"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597734"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_3_2_1_43_1","volume-title":"On semiamarts, amarts, and processes with finite value. Probability on Banach spaces, 4","author":"Krengel Ulrich","year":"1978","unstructured":"Ulrich Krengel and Louis Sucheston. 1978. On semiamarts, amarts, and processes with finite value. Probability on Banach spaces, 4 (1978), 197\u2013266."},{"key":"e_1_3_2_1_44_1","unstructured":"Euiwoong Lee and Sahil Singla. 2018. Optimal online contention resolution schemes via ex-ante prophet inequalities. arXiv preprint arXiv:1806.09251."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467598"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3144722.3144725"},{"key":"e_1_3_2_1_47_1","volume-title":"Optimal auction design. Mathematics of operations research, 6, 1","author":"Myerson Roger B","year":"1981","unstructured":"Roger B Myerson. 1981. Optimal auction design. Mathematics of operations research, 6, 1 (1981), 58\u201373."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04612-5_24"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467613"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538295"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897540"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.110"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Ester Samuel-Cahn. 1984. Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability 1213\u20131216.","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467614"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133092"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649786","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:52Z","timestamp":1750291432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":55,"alternative-id":["10.1145\/3618260.3649786","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649786","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}