{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:59Z","timestamp":1750309559522,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,28]]},"DOI":"10.1145\/3696410.3714709","type":"proceedings-article","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T22:47:11Z","timestamp":1745362031000},"page":"3335-3343","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Procurement Auctions with Best and Final Offers"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7203-438X","authenticated-orcid":false,"given":"Vasilis","family":"Gkatzelis","sequence":"first","affiliation":[{"name":"Computer Science, Drexel University, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2587-3161","authenticated-orcid":false,"given":"Randolph Preston","family":"McAfee","sequence":"additional","affiliation":[{"name":"Google Research, Hermosa Beach, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9799-5766","authenticated-orcid":false,"given":"Renato","family":"Paes Leme","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1257\/0002828043052330"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1257\/aer.96.3.602"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1257\/aer.104.5.446"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.2202\/1534-5963.1019"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1257\/mic.20160087"},{"unstructured":"Kshipra Bhawalkar Christopher Liaw and Aranyak Mehta. 2025. personal communication.","key":"e_1_3_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1006\/jeth.2001.2957"},{"key":"e_1_3_2_1_8_1","volume-title":"On\u00e2''Line Reverse Auctions. https:\/\/www.acquisition.gov\/afars\/\u00e2''line-reverse-auctions. [accessed","author":"Federal Acquisition Regulatory Council","year":"2025","unstructured":"Federal Acquisition Regulatory Council. 2024. On\u00e2''Line Reverse Auctions. https:\/\/www.acquisition.gov\/afars\/\u00e2''line-reverse-auctions. [accessed 3 March 2025]."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/s10683-011-9301-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1016\/j.jet.2005.07.010"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1086\/261411"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1287\/moor.2016.0835"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1006\/jeth.1999.2531"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 16th ACM Conference on Electronic Commerce.","author":"Hatfield John William","year":"2016","unstructured":"John William Hatfield and Scott Duke Kominers. 2016. Hidden substitutes. In Proceedings of the 16th ACM Conference on Electronic Commerce."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.2307\/1913392"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/2090236.2090242"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1137\/1.9781611973099.70"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1086\/704074"},{"key":"e_1_3_2_1_19_1","volume-title":"Iterative combinatorial auctions: Theory and practice. Aaai\/iaai","author":"Parkes David C","year":"2000","unstructured":"David C Parkes and Lyle H Ungar. 2000. Iterative combinatorial auctions: Theory and practice. Aaai\/iaai, Vol. 7481 (2000), 53."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1111\/j.1467-937X.2005.00343.x"},{"key":"e_1_3_2_1_21_1","volume-title":"Bargaining under asymmetric information. Econometrica: Journal of the Econometric Society","author":"Samuelson William","year":"1984","unstructured":"William Samuelson. 1984. Bargaining under asymmetric information. Econometrica: Journal of the Econometric Society (1984), 995--1005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1111\/j.1468-0262.2006.00708.x"}],"event":{"sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"acronym":"WWW '25","name":"WWW '25: The ACM Web Conference 2025","location":"Sydney NSW Australia"},"container-title":["Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714709","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696410.3714709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:57Z","timestamp":1750295937000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":22,"alternative-id":["10.1145\/3696410.3714709","10.1145\/3696410"],"URL":"https:\/\/doi.org\/10.1145\/3696410.3714709","relation":{},"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"2025-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}