{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:43:01Z","timestamp":1771623781630,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"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":[[2019,6,17]]},"DOI":"10.1145\/3328526.3329604","type":"proceedings-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T12:45:07Z","timestamp":1561121107000},"page":"93-109","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Prophet Inequality for Bipartite Matching"],"prefix":"10.1145","author":[{"given":"Nikolai","family":"Gravin","sequence":"first","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}]},{"given":"Hongao","family":"Wang","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133131"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/120878422"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229018"},{"key":"e_1_3_2_2_4_1","volume-title":"APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21--23, 2013. Proceedings . 11--25","author":"Alaei Saeed","year":"2013"},{"key":"e_1_3_2_2_5_1","unstructured":"Itai Ashlagi Maximilien Burq Patrick Jaillet and Amin Saberi. 2018. Maximizing Efficiency in Dynamic Matching Markets. CoRR Vol. abs\/1803.01285 (2018). arxiv: 1803.01285 http:\/\/arxiv.org\/abs\/1803.01285  Itai Ashlagi Maximilien Burq Patrick Jaillet and Amin Saberi. 2018. Maximizing Efficiency in Dynamic Matching Markets. CoRR Vol. abs\/1803.01285 (2018). arxiv: 1803.01285 http:\/\/arxiv.org\/abs\/1803.01285"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.100"},{"key":"e_1_3_2_2_7_1","volume-title":"15th Annual European Symposium, Eilat, Israel, October 8--10, 2007, Proceedings. 253--264","author":"Buchbinder Niv","year":"2007"},{"key":"e_1_3_2_2_8_1","volume-title":"Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. In 25th Annual European Symposium on Algorithms, ESA 2017","author":"Buchbinder Niv","year":"2017"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250946"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_2_11_1","volume-title":"Proceedings. 325--336","author":"Chiplunkar Ashish","year":"2015"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722136"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940730"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2018.11.010"},{"key":"e_1_3_2_2_15_1","volume-title":"Proceedings 10th ACM Conference on Electronic Commerce (EC-2009)","author":"Nikhil","year":"2009"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3284177"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.56"},{"key":"e_1_3_2_2_18_1","volume-title":"Proceedings . 437--449","author":"Paul"},{"key":"e_1_3_2_2_19_1","volume-title":"Improved Bounds for Online Preemptive Matching. In 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013","author":"Epstein Leah","year":"2013"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085129"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Michal Feldman Nick Gravin and Brendan Lucier. 2015. Combinatorial Auctions via Posted Prices. In SODA. 123--135.   Michal Feldman Nick Gravin and Brendan Lucier. 2015. Combinatorial Auctions via Posted Prices. In SODA. 123--135.","DOI":"10.1137\/1.9781611973730.10"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884507"},{"key":"e_1_3_2_2_24_1","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008","author":"Goel Gagan","year":"2008"},{"key":"e_1_3_2_2_25_1","volume-title":"WINE 2011, Singapore, December 11--14, 2011. Proceedings. 170--181","author":"Haeupler Bernhard","year":"2011"},{"key":"e_1_3_2_2_26_1","volume-title":"Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, July 22--26","author":"Hajiaghayi Mohammad Taghi","year":"2007"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/125\/1160620"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188858"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.178"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993715"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993009"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4149(87)90029-9"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.2307\/1427302"},{"key":"e_1_3_2_2_35_1","volume-title":"Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012","author":"Kleinberg Robert","year":"2012"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133134"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_15"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095250"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897540"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039746"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"}],"event":{"name":"EC '19: ACM Conference on Economics and Computation","location":"Phoenix AZ USA","acronym":"EC '19","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 2019 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329604","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3328526.3329604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:41Z","timestamp":1750204421000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329604"}},"subtitle":["Merits of Being Simple and Non Adaptive"],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":44,"alternative-id":["10.1145\/3328526.3329604","10.1145\/3328526"],"URL":"https:\/\/doi.org\/10.1145\/3328526.3329604","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}