{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T03:24:50Z","timestamp":1793071490203,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF191070"],"award-info":[{"award-number":["CCF191070"]}]},{"name":"NSF","award":["CCF1763970"],"award-info":[{"award-number":["CCF1763970"]}]},{"name":"NSF","award":["CCF1812919"],"award-info":[{"award-number":["CCF1812919"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467613","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T06:28:45Z","timestamp":1626589725000},"page":"763-764","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities"],"prefix":"10.1145","author":[{"given":"Christos","family":"Papadimitriou","sequence":"first","affiliation":[{"name":"Columbia University, New York City, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tristan","family":"Pollner","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amin","family":"Saberi","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Wajc","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793260738"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399513"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 123--135","author":"Feldman Michal","year":"2014","unstructured":"Michal Feldman , Nick Gravin , and Brendan Lucier . 2014 . Combinatorial auctions via posted prices . In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 123--135 . Michal Feldman, Nick Gravin, and Brendan Lucier. 2014. Combinatorial auctions via posted prices. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 123--135."},{"key":"e_1_3_2_1_4_1","volume-title":"48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)","author":"Saberi Amin","year":"2021","unstructured":"Amin Saberi and David Wajc . 2021 . The Greedy Algorithm is not Optimal for Online Edge Coloring. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) . Amin Saberi and David Wajc. 2021. The Greedy Algorithm is not Optimal for Online Edge Coloring. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) ."},{"key":"e_1_3_2_1_5_1","volume-title":"Dynamic Relaxations for Online Bipartite Matching. arXiv preprint arXiv:1709.01557","author":"Torrico Alfredo","year":"2017","unstructured":"Alfredo Torrico and Alejandro Toriello . 2017. Dynamic Relaxations for Online Bipartite Matching. arXiv preprint arXiv:1709.01557 ( 2017 ). Alfredo Torrico and Alejandro Toriello. 2017. Dynamic Relaxations for Online Bipartite Matching. arXiv preprint arXiv:1709.01557 (2017)."}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","location":"Budapest Hungary","acronym":"EC '21","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467613","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467613","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:17:28Z","timestamp":1750177048000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":5,"alternative-id":["10.1145\/3465456.3467613","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467613","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}