{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T04:56:51Z","timestamp":1777006611010,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-2139899"],"award-info":[{"award-number":["DGE-2139899"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1942497"],"award-info":[{"award-number":["CCF-1942497"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673627","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"420-446","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Settling the Competition Complexity of Additive Buyers over Independent Items"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8147-0113","authenticated-orcid":false,"given":"Mahsa","family":"Derakhshan","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8296-8343","authenticated-orcid":false,"given":"Emily","family":"Ryu","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7744-795X","authenticated-orcid":false,"given":"S. Matthew","family":"Weinberg","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3977-8173","authenticated-orcid":false,"given":"Eric","family":"Xue","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538375"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219225"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3398745"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_15"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133093"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Hedyeh Beyhaghi and S. Matthew Weinberg. 2018. Optimal (and Benchmark-Optimal) Competition Complexity for Additive Buyers over Independent Items. 10.48550\/ARXIV.1812.01794","DOI":"10.48550\/ARXIV.1812.01794"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 51st ACM Symposium on Theory of Computing Conference (STOC).","author":"Beyhaghi Hedyeh","unstructured":"Hedyeh Beyhaghi and S. Matthew Weinberg. 2019. Optimal (and Benchmark-Optimal) Competition Complexity for Additive Buyers over Independent Items. In Proceedings of the 51st ACM Symposium on Theory of Computing Conference (STOC)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.04.011"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538366"},{"key":"e_1_3_2_1_10_1","volume-title":"Auctions Versus Negotiations. The American Economic Review","author":"Bulow Jeremy","year":"1996","unstructured":"Jeremy Bulow and Paul Klemperer. 1996. Auctions Versus Negotiations. The American Economic Review (1996), 180--194."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467647"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 48th ACM Conference on Theory of Computation(STOC).","author":"Cai Yang","unstructured":"Yang Cai, Nikhil Devanur, and S. Matthew Weinberg. 2016. A Duality Based Unified Approach to Bayesian Mechanism Design. In Proceedings of the 48th ACM Conference on Theory of Computation(STOC)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.81"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520029"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055465"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488616"},{"key":"e_1_3_2_1_17_1","volume-title":"the 8th ACM Conference on Electronic Commerce (EC).","author":"Chawla Shuchi","unstructured":"Shuchi Chawla, Jason D. Hartline, and Robert D. Kleinberg. 2007. Algorithmic Pricing via Virtual Valuations. In the 8th ACM Conference on Electronic Commerce (EC)."},{"key":"e_1_3_2_1_18_1","volume-title":"Multi-Parameter Mechanism Design and Sequential Posted Pricing. In the 42nd ACM Symposium on Theory of Computing (STOC).","author":"Chawla Shuchi","year":"2010","unstructured":"Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. 2010. Multi-Parameter Mechanism Design and Sequential Posted Pricing. In the 42nd ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.08.010"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940756"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1136481"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01726210"},{"key":"e_1_3_2_1_23_1","volume-title":"The Complexity of Optimal Mechanism Design. In the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Daskalakis Constantinos","year":"2014","unstructured":"Constantinos Daskalakis, Alan Deckelbaum, and Christos Tzamos. 2014. The Complexity of Optimal Mechanism Design. In the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA12618"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229042"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055492"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085115"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2039"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219202"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329597"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602883"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_52"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764498"},{"key":"e_1_3_2_1_35_1","volume-title":"the 14th ACM Conference on Electronic Commerce (EC).","author":"Hart Sergiu","year":"2013","unstructured":"Sergiu Hart and Noam Nisan. 2013. The menu-size complexity of auctions. In the 14th ACM Conference on Electronic Commerce (EC)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2017.09.001"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE1517"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133094"},{"key":"e_1_3_2_1_39_1","volume-title":"ACM Conference on Electronic Commerce. 225--234","author":"Jason","unstructured":"Jason D. Hartline and Tim Roughgarden. 2009. Simple versus optimal mechanisms. In ACM Conference on Electronic Commerce. 225--234."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.131"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_43_1","article-title":"Optimal Mechanism for Selling Two Goods","volume":"11","author":"Pavlov Gregory","year":"2011","unstructured":"Gregory Pavlov. 2011. Optimal Mechanism for Selling Two Goods. The B.E. Journal of Theoretical Economics 11, 3 (2011).","journal-title":"Journal of Theoretical Economics"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329563"},{"key":"e_1_3_2_1_45_1","unstructured":"Alexandros Psomas Ariel Schvartzman and S. Matthew Weinberg. 2022. On Infinite Separations Between Simple and Optimal Mechanisms. In NeurIPS. http:\/\/papers.nips.cc\/paper_files\/paper\/2022\/hash\/1eeacdf8770e6dd5164cdeec8bcfa8cc-Abstract-Conference.html"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.2307\/2999574"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229077"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764510"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2003.09.002"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538334"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085120"},{"key":"e_1_3_2_1_55_1","volume-title":"An Incentive Analysis of some Bitcoin Fee Designs. CoRR abs\/1811.02351","author":"Chi-Chih Yao Andrew","year":"2018","unstructured":"Andrew Chi-Chih Yao. 2018. An Incentive Analysis of some Bitcoin Fee Designs. CoRR abs\/1811.02351 (2018). arXiv:1811.02351 http:\/\/arxiv.org\/abs\/1811.02351"},{"key":"e_1_3_2_1_56_1","volume-title":"the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Chi-Chih Yao Andrew","year":"2015","unstructured":"Andrew Chi-Chih Yao. 2015. An n-to-1 bidder reduction for multi-item auctions and its applications. In the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."}],"event":{"name":"EC '24: 25th ACM Conference on Economics and Computation","location":"New Haven CT USA","acronym":"EC '24","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673627","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673627","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:01Z","timestamp":1750295401000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":56,"alternative-id":["10.1145\/3670865.3673627","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673627","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-12-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}