{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:40Z","timestamp":1750219780230,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"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":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597662","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"123-152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8914-5995","authenticated-orcid":false,"given":"Sepehr","family":"Assadi","sequence":"first","affiliation":[{"name":"Rutgers University, New Brunswick, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0097-3113","authenticated-orcid":false,"given":"Vikram","family":"Kher","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4845-7507","authenticated-orcid":false,"given":"George","family":"Li","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4016-6235","authenticated-orcid":false,"given":"Ariel","family":"Schvartzman","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055426"},{"volume-title":"the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Babaioff Moshe","key":"e_1_3_2_1_2_1","unstructured":"Moshe Babaioff , Nicole Immorlica , Brendan Lucier , and S. Matthew Weinberg . 2014. A Simple and Approximately Optimal Mechanism for an Additive Buyer . In the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS). Moshe Babaioff, Nicole Immorlica, Brendan Lucier, and S. Matthew Weinberg. 2014. A Simple and Approximately Optimal Mechanism for an Additive Buyer. In the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"volume-title":"Pricing Randomized Allocations. In the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Briest Patrick","key":"e_1_3_2_1_3_1","unstructured":"Patrick Briest , Shuchi Chawla , Robert Kleinberg , and S. Matthew Weinberg . 2010 . Pricing Randomized Allocations. In the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Patrick Briest, Shuchi Chawla, Robert Kleinberg, and S. Matthew Weinberg. 2010. Pricing Randomized Allocations. In the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.04.011"},{"volume-title":"Proceedings of the 48th ACM Conference on Theory of Computation(STOC).","author":"Cai Yang","key":"e_1_3_2_1_5_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_1_6_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_1_7_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_1_8_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). 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_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.08.010"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940756"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520065"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329583"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3440959.3440963"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399453"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2845926.2845928"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0012"},{"key":"e_1_3_2_1_17_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_1_18_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_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2017.09.001"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE1517"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00023"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329563"},{"key":"e_1_3_2_1_26_1","volume-title":"On Infinite Separations Between Simple and Optimal Mechanisms: A Converse of a Theorem of Hart and Nisan. Manuscript","author":"Psomas Alexandros","year":"2022","unstructured":"Alexandros Psomas , Ariel Schvartzman , and S. Matthew Weinberg . 2022. On Infinite Separations Between Simple and Optimal Mechanisms: A Converse of a Theorem of Hart and Nisan. Manuscript ( 2022 ). Alexandros Psomas, Ariel Schvartzman, and S. Matthew Weinberg. 2022. On Infinite Separations Between Simple and Optimal Mechanisms: A Converse of a Theorem of Hart and Nisan. Manuscript (2022)."},{"volume-title":"Proceedings of the 16th ACM Conference on Electronic Commerce.","author":"Rubinstein Aviad","key":"e_1_3_2_1_27_1","unstructured":"Aviad Rubinstein and S. Matthew Weinberg . 2015. Simple Mechanisms for a subadditive buyer and applications to revenue monotonicity . In Proceedings of the 16th ACM Conference on Electronic Commerce. Aviad Rubinstein and S. Matthew Weinberg. 2015. Simple Mechanisms for a subadditive buyer and applications to revenue monotonicity. In Proceedings of the 16th ACM Conference on Electronic Commerce."},{"key":"e_1_3_2_1_28_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 '23: 24th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"London United Kingdom","acronym":"EC '23"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597662","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:42Z","timestamp":1750178262000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":28,"alternative-id":["10.1145\/3580507.3597662","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597662","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}