{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:17:25Z","timestamp":1751516245959,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","funder":[{"DOI":"10.13039\/100000001","name":"NSF (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":[[2025,7,7]]},"DOI":"10.1145\/3736252.3742655","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:49:32Z","timestamp":1751482172000},"page":"946-974","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A QPTAS For Up-To-\u03b5 Revenue Maximization With Multiple Constant-Demand Bidders Over Independent Items"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4530-9012","authenticated-orcid":false,"given":"Dimitar","family":"Chakarov","sequence":"first","affiliation":[{"name":"Toyota Technological Institute at Chicago, Chicago, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7744-795X","authenticated-orcid":false,"given":"S. Matthew","family":"Weinberg","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3977-8173","authenticated-orcid":false,"given":"Eric","family":"Xue","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2021.03.001"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Moshe Babaioff Nicole Immorlica Brendan Lucier and S. Matthew Weinberg. 2020. A Simple and Approximately Optimal Mechanism for an Additive Buyer. http:\/\/arxiv.org\/abs\/1405.6146 arXiv:1405.6146 [cs].","DOI":"10.1145\/3398745"},{"key":"e_1_3_2_1_3_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_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.04.011"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897645"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Yang Cai Nikhil R. Devanur and S. Matthew Weinberg. 2018. A Duality-Based Unified Approach to Bayesian Mechanism Design. arXiv:1812.01577 [cs]. 10.48550\/arXiv.1812.01577","DOI":"10.48550\/arXiv.1812.01577"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Yang Cai Argyris Oikonomou Grigoris Velegkas and Mingfei Zhao. 2020. An Efficient \u03f5-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization. http:\/\/arxiv.org\/abs\/1911.10172 arXiv:1911.10172 [cs].","DOI":"10.1137\/1.9781611976465.81"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055465"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250946"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.08.010"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229042"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3670865.3673627"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35389-6_11"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1098334"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085115"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2039"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219202"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3439722"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2017.09.001"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.07.006"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00082"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00023"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329563"},{"key":"e_1_3_2_1_27_1","volume-title":"On Infinite Separations Between Simple and Optimal Mechanisms. In Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022","author":"Psomas Alexandros","year":"2022","unstructured":"Alexandros Psomas, Ariel Schvartzman, and S. Matthew Weinberg. 2022. On Infinite Separations Between Simple and Optimal Mechanisms. In Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022, Sanmi Koyejo, S. Mohamed, A. Agarwal, Danielle Belgrave, K. Cho, and A. Oh (Eds.). http:\/\/papers.nips.cc\/paper_files\/paper\/2022\/hash\/1eeacdf8770e6dd5164cdeec8bcfa8cc-Abstract-Conference.html"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229077"},{"key":"e_1_3_2_1_29_1","unstructured":"Aviad Rubinstein and S. Matthew Weinberg. 2018. Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity. http:\/\/arxiv.org\/abs\/1501.07637 arXiv:1501.07637 [cs]."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.8"}],"event":{"name":"EC '25: 26th ACM Conference on Economics and Computation","location":"Stanford University Stanford CA USA","acronym":"EC '25","sponsor":["SIGecom ACM Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 26th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736252.3742655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:52:11Z","timestamp":1751482331000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":30,"alternative-id":["10.1145\/3736252.3742655","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742655","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2025-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}