{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:23Z","timestamp":1750220363145,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467647","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:50Z","timestamp":1626604130000},"page":"224-241","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["99% Revenue with Constant Enhanced Competition"],"prefix":"10.1145","author":[{"given":"Linda","family":"Cai","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghuvansh R.","family":"Saxena","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013","author":"Azar Pablo Daniel","year":"2013","unstructured":"Pablo Daniel Azar , Constantinos Daskalakis , Silvio Micali , and S. Matthew Weinberg . 2013. Optimal and Efficient Parametric Auctions . In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 , New Orleans, Louisiana, USA, January 6--8 , 2013 . 596--604. https:\/\/doi.org\/10.1137\/1.9781611973105.43 Pablo Daniel Azar, Constantinos Daskalakis, Silvio Micali, and S. Matthew Weinberg. 2013. Optimal and Efficient Parametric Auctions. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6--8, 2013. 596--604. https:\/\/doi.org\/10.1137\/1.9781611973105.43"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.100"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.11"},{"key":"e_1_3_2_2_4_1","volume-title":"Revenue Maximization for Selling Multiple Correlated Items. In the 23rd Annual European Symposium on Algorithms (ESA) .","author":"Bateni MohammadHossein","year":"2015","unstructured":"MohammadHossein Bateni , Sina Dehghani , MohammadTaghi Hajiaghayi , and Saeed Seddighin . 2015 . Revenue Maximization for Selling Multiple Correlated Items. In the 23rd Annual European Symposium on Algorithms (ESA) . MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, and Saeed Seddighin. 2015. Revenue Maximization for Selling Multiple Correlated Items. In the 23rd Annual European Symposium on Algorithms (ESA) ."},{"volume-title":"Proceedings of the 51st ACM Symposium on Theory of Computing Conference (STOC) .","author":"Beyhaghi Hedyeh","key":"e_1_3_2_2_5_1","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) . 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_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085148"},{"key":"e_1_3_2_2_7_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. Jeremy Bulow and Paul Klemperer. 1996. Auctions Versus Negotiations. The American Economic Review (1996), 180--194."},{"volume-title":"Proceedings of the 48th ACM Conference on Theory of Computation(STOC) .","author":"Cai Yang","key":"e_1_3_2_2_8_1","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) . 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_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055465"},{"volume-title":"the 8th ACM Conference on Electronic Commerce (EC) .","author":"Chawla Shuchi","key":"e_1_3_2_2_10_1","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) . 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_2_11_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 a. Multi-Parameter Mechanism Design and Sequential Posted Pricing. In the 42nd ACM Symposium on Theory of Computing (STOC) . Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. 2010a. Multi-Parameter Mechanism Design and Sequential Posted Pricing. In the 42nd ACM Symposium on Theory of Computing (STOC) ."},{"key":"e_1_3_2_2_12_1","volume-title":"The Power of Randomness in Bayesian Optimal Mechanism Design. In the 11th ACM Conference on Electronic Commerce (EC) .","author":"Chawla Shuchi","year":"2010","unstructured":"Shuchi Chawla , David L. Malec , and Balasubramanian Sivan . 2010 b. The Power of Randomness in Bayesian Optimal Mechanism Design. In the 11th ACM Conference on Electronic Commerce (EC) . Shuchi Chawla, David L. Malec, and Balasubramanian Sivan. 2010b. The Power of Randomness in Bayesian Optimal Mechanism Design. In the 11th ACM Conference on Electronic Commerce (EC) ."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.08.010"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940756"},{"key":"e_1_3_2_2_15_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) . 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_2_16_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA12618"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_11"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085132"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085115"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085116"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219202"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.162"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54110-4_12"},{"key":"e_1_3_2_2_24_1","volume-title":"Approximate Revenue Maximization with Multiple Items. In the 13th ACM Conference on Electronic Commerce (EC).","author":"Hart Sergiu","year":"2012","unstructured":"Sergiu Hart and Noam Nisan . 2012 . Approximate Revenue Maximization with Multiple Items. In the 13th ACM Conference on Electronic Commerce (EC). Sergiu Hart and Noam Nisan. 2012. Approximate Revenue Maximization with Multiple Items. In the 13th ACM Conference on Electronic Commerce (EC)."},{"key":"e_1_3_2_2_25_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) . 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_2_26_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE1517"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.131"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2006.12.007"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_2_31_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 , Vol. 11 , 3 (2011). Gregory Pavlov. 2011. Optimal Mechanism for Selling Two Goods. The B.E. Journal of Theoretical Economics, Vol. 11, 3 (2011).","journal-title":"Journal of Theoretical Economics"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501160"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1929"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764510"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45046-4_35"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2003.09.002"},{"key":"e_1_3_2_2_37_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). 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 '21: The 22nd ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Budapest Hungary","acronym":"EC '21"},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467647","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":37,"alternative-id":["10.1145\/3465456.3467647","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467647","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"}}]}}