{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T04:56:47Z","timestamp":1777006607049,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["CCF-1955205"],"award-info":[{"award-number":["CCF-1955205"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538334","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"875-896","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Multi-Dimensional Mechanisms are not Locally-Implementable"],"prefix":"10.1145","author":[{"given":"S. Matthew","family":"Weinberg","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zixin","family":"Zhou","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/120878422"},{"key":"e_1_3_2_1_2_1","volume-title":"The Simple Economics of Approximately Optimal Auctions. In the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Alaei Saeed","year":"2013","unstructured":"Saeed Alaei , Hu Fu , Nima Haghpanah , and Jason Hartline . 2013 . The Simple Economics of Approximately Optimal Auctions. In the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS). Saeed Alaei, Hu Fu, Nima Haghpanah, and Jason Hartline. 2013. The Simple Economics of Approximately Optimal Auctions. In the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229017"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.08.007"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055426"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.04.011"},{"key":"e_1_3_2_1_8_1","volume-title":"the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Briest Patrick","year":"2007","unstructured":"Patrick Briest and Piotr Krysta . 2007 . Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing . In the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Patrick Briest and Piotr Krysta. 2007. Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. In the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012","author":"Cai Yang","year":"2012","unstructured":"Yang Cai , Constantinos Daskalakis , and S. Matthew Weinberg . 2012. An algorithmic characterization of multi-dimensional mechanisms . In Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012 , New York, NY, USA, May 19 - 22 , 2012 . 459--478. https:\/\/doi.org\/10.1145\/2213977.2214021 10.1145\/2213977.2214021 Yang Cai, Constantinos Daskalakis, and S. Matthew Weinberg. 2012. An algorithmic characterization of multi-dimensional mechanisms. In Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012. 459--478. https:\/\/doi.org\/10.1145\/2213977.2214021"},{"key":"e_1_3_2_1_10_1","volume-title":"Understanding Incentives: Mechanism Design Becomes Algorithm Design. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013","author":"Cai Yang","year":"2013","unstructured":"Yang Cai , Constantinos Daskalakis , and S. Matthew Weinberg . 2013 . Understanding Incentives: Mechanism Design Becomes Algorithm Design. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013 , 26--29 October , 2013 , Berkeley, CA, USA. 618--627. https:\/\/doi.org\/10.1109\/FOCS. 2013.72 10.1109\/FOCS.2013.72 Yang Cai, Constantinos Daskalakis, and S. Matthew Weinberg. 2013. Understanding Incentives: Mechanism Design Becomes Algorithm Design. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26--29 October, 2013, Berkeley, CA, USA. 618--627. https:\/\/doi.org\/10.1109\/FOCS.2013.72"},{"key":"e_1_3_2_1_11_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). 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_12_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA14165"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993613"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1999.2639"},{"key":"e_1_3_2_1_15_1","volume-title":"On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015","author":"Chen Xi","year":"2015","unstructured":"Xi Chen , Ilias Diakonikolas , Anthi Orfanou , Dimitris Paparas , Xiaorui Sun , and Mihalis Yannakakis . 2015 . On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015 , Berkeley, CA, USA, 17- -20 October, 2015. 1464--1479. https:\/\/doi.org\/10.1109\/FOCS.2015.93 10.1109\/FOCS.2015.93 Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, and Mihalis Yannakakis. 2015. On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17--20 October, 2015. 1464--1479. https:\/\/doi.org\/10.1109\/FOCS.2015.93"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.97"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175438"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399496"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_22"},{"key":"e_1_3_2_1_20_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_1_21_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA12618"},{"key":"e_1_3_2_1_22_1","volume-title":"Optimal Mechanism Design for Single-Minded Agents. In EC '20: The 21st ACM Conference on Economics and Computation","author":"Devanur Nikhil R.","year":"2020","unstructured":"Nikhil R. Devanur , Kira Goldner , Raghuvansh R. Saxena , Ariel Schvartzman , and S. Matthew Weinberg . 2020 . Optimal Mechanism Design for Single-Minded Agents. In EC '20: The 21st ACM Conference on Economics and Computation , Virtual Event, Hungary, July 13--17 , 2020 , P\u00e9 ter Bir\u00f3, Jason Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 193--256. https:\/\/doi.org\/10.1145\/3391403.3399454 10.1145\/3391403.3399454 Nikhil R. Devanur, Kira Goldner, Raghuvansh R. Saxena, Ariel Schvartzman, and S. Matthew Weinberg. 2020. Optimal Mechanism Design for Single-Minded Agents. In EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13--17, 2020, P\u00e9 ter Bir\u00f3, Jason Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 193--256. https:\/\/doi.org\/10.1145\/3391403.3399454"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085122"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085132"},{"key":"e_1_3_2_1_25_1","volume-title":"the 43rd ACM Symposium on Theory of Computing (STOC).","author":"Dobzinski Shahar","unstructured":"Shahar Dobzinski , Hu Fu , and Robert D. Kleinberg . 2011. Optimal Auctions with Correlated Bidders are Easy . In the 43rd ACM Symposium on Theory of Computing (STOC). Shahar Dobzinski, Hu Fu, and Robert D. Kleinberg. 2011. Optimal Auctions with Correlated Bidders are Easy. In the 43rd ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451083"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2007.09.015"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940752"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764498"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.07.006"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE1517"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"e_1_3_2_1_33_1","volume-title":"Communication complexity","author":"Kushilevitz Eyal","unstructured":"Eyal Kushilevitz and Noam Nisan . 1997. Communication complexity . Cambridge University Press . Eyal Kushilevitz and Noam Nisan. 1997. Communication complexity .Cambridge University Press."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-1765(96)00849-X"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2006.12.007"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2013.09.015"},{"key":"e_1_3_2_1_39_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_1_40_1","volume-title":"Communication Complexity and Applications","author":"Rao Anup","unstructured":"Anup Rao and Amir Yehudayoff . 2020. Communication Complexity and Applications . Cambridge University Press . Anup Rao and Amir Yehudayoff. 2020. Communication Complexity and Applications .Cambridge University Press."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_1_42_1","volume-title":"7th World Congress","author":"Rochet Jean-Charles","year":"2003","unstructured":"Jean-Charles Rochet and Lars A. Stole . 2003. The Economics of Multidimensional Screening. Advances in Economic Theory , 7th World Congress ( 2003 ). Jean-Charles Rochet and Lars A. Stole. 2003. The Economics of Multidimensional Screening. Advances in Economic Theory, 7th World Congress (2003)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451127"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3105448"},{"key":"e_1_3_2_1_45_1","volume-title":"Symposium on Theory of Computing, STOC","author":"Rubinstein Aviad","year":"2021","unstructured":"Aviad Rubinstein and Junyao Zhao . 2021 . The randomized communication complexity of optimal randomized auctions . In Symposium on Theory of Computing, STOC 2021. ACM. Aviad Rubinstein and Junyao Zhao. 2021. The randomized communication complexity of optimal randomized auctions. In Symposium on Theory of Computing, STOC 2021. ACM."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2003.09.002"},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of the 2017 ACM Conference on Economics and Computation, EC '17","author":"Chi-Chih Yao Andrew","year":"2017","unstructured":"Andrew Chi-Chih Yao . 2017 . Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison . In Proceedings of the 2017 ACM Conference on Economics and Computation, EC '17 , Cambridge, MA, USA, June 26--30 , 2017, Constantinos Daskalakis, Moshe Babaioff, and Herv\u00e9 Moulin (Eds.). ACM, 3--20. https:\/\/doi.org\/10.1145\/3033274.3085120 10.1145\/3033274.3085120 Andrew Chi-Chih Yao. 2017. Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison. In Proceedings of the 2017 ACM Conference on Economics and Computation, EC '17, Cambridge, MA, USA, June 26--30, 2017, Constantinos Daskalakis, Moshe Babaioff, and Herv\u00e9 Moulin (Eds.). ACM, 3--20. https:\/\/doi.org\/10.1145\/3033274.3085120"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","location":"Boulder CO USA","acronym":"EC '22","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538334","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:59Z","timestamp":1750186979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":48,"alternative-id":["10.1145\/3490486.3538334","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538334","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}