{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T15:48:57Z","timestamp":1773935337423,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649788","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1629-1640","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0966-4332","authenticated-orcid":false,"given":"Calum","family":"MacRury","sequence":"first","affiliation":[{"name":"Columbia University, New York City, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2420-4468","authenticated-orcid":false,"given":"Will","family":"Ma","sequence":"additional","affiliation":[{"name":"Columbia University, New York City, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Patras","volume":"12","author":"Adamczyk Marek","year":"2015","unstructured":"Marek Adamczyk, Fabrizio Grandoni, and Joydeep Mukherjee. 2015. Improved Approximation Algorithms for Stochastic Matching. In Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, Nikhil Bansal and Irene Finocchi (Eds.) (Lecture Notes in Computer Science, Vol. 9294). Springer, 1\u201312."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2302.12358"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2303.08908"},{"key":"e_1_3_2_1_4_1","first-page":"27184","article-title":"Improved guarantees for offline stochastic matching via new ordered contention resolution schemes","volume":"34","author":"Brubach Brian","year":"2021","unstructured":"Brian Brubach, Nathaniel Grammel, Will Ma, and Aravind Srinivasan. 2021. Improved guarantees for offline stochastic matching via new ordered contention resolution schemes. Advances in Neural Information Processing Systems, 34 (2021), 27184\u201327195.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00603-7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01570-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/110839655"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_23"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch74"},{"key":"e_1_3_2_1_10_1","unstructured":"Mahsa Derakhshan and Mohammad Saneian. 2023. Query Efficient Weighted Stochastic Matching. arxiv:2311.08513."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1152"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1226130"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2021.68"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.176"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Iraj Kalantari. 2007. Induction over the Continuum. 145\u2013154. isbn:978-1-4020-6126-4 https:\/\/doi.org\/10.1007\/978-1-4020-6127-1_5 10.1007\/978-1-4020-6127-1_5","DOI":"10.1007\/978-1-4020-6127-1_5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.21"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519986"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2018.57"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.85"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2310.10101"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch76"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-32726-1_27"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.161"},{"key":"e_1_3_2_1_24_1","volume-title":"On Wormald\u2019s differential equation method. Accepted to Combinatorics, Probability, and Computing, abs\/1905.08928","author":"Warnke Lutz","year":"2019","unstructured":"Lutz Warnke. 2019. On Wormald\u2019s differential equation method. Accepted to Combinatorics, Probability, and Computing, abs\/1905.08928 (2019), arxiv:1905.08928. arxiv:1905.08928"},{"key":"e_1_3_2_1_25_1","volume-title":"The differential equation method for random graph processes and greedy algorithms. Lectures on approximation and randomized algorithms, 73","author":"Wormald Nicholas C","year":"1999","unstructured":"Nicholas C Wormald. 1999. The differential equation method for random graph processes and greedy algorithms. Lectures on approximation and randomized algorithms, 73 (1999), 155."}],"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.3649788","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649788","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.3649788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":25,"alternative-id":["10.1145\/3618260.3649788","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649788","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"}}]}}