{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:09Z","timestamp":1750220529242,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":81,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"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,6,15]]},"DOI":"10.1145\/3406325.3451111","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"882-895","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The randomized communication complexity of randomized auctions"],"prefix":"10.1145","author":[{"given":"Aviad","family":"Rubinstein","sequence":"first","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyao","family":"Zhao","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129086"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085121"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384267"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.08.007"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055426"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.11"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2724705"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055407"},{"volume-title":"The Functions of the Executive","author":"Barnard Chester Irving","key":"e_1_3_2_1_9_1","unstructured":"Chester Irving Barnard. 1938. The Functions of the Executive. Harvard University Press."},{"volume-title":"Proceedings of the 51st ACM Symposium on Theory of Computing Conference (STOC).","author":"Beyhaghi Hedyeh","key":"e_1_3_2_1_10_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)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2013.03.005"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2081"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329644"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch99"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.146"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.49"},{"volume-title":"Proceedings of the 48th ACM Conference on Theory of Computation(STOC).","author":"Cai Yang","key":"e_1_3_2_1_17_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)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055465"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.005"},{"volume-title":"the 8th ACM Conference on Electronic Commerce (EC).","author":"Chawla Shuchi","key":"e_1_3_2_1_20_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)."},{"key":"e_1_3_2_1_21_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_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.08.010"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940756"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329583"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.93"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.97"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04612-5_7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015351"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988824"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064018"},{"key":"e_1_3_2_1_31_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_32_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA12618"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897569"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Shahar Dobzinski. 2016. Computational Efficiency Requires Simple Taxation. In FOCS.","DOI":"10.1109\/FOCS.2016.30"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/090780146"},{"volume-title":"Economic Efficiency Requires Interaction. In the 46th annual ACM symposium on Theory of computing (STOC)","author":"Dobzinski Shahar","key":"e_1_3_2_1_36_1","unstructured":"Shahar Dobzinski, Noam Nisan, and Sigal Oren. 2014. Economic Efficiency Requires Interaction. In the 46th annual ACM symposium on Theory of computing (STOC)."},{"key":"e_1_3_2_1_37_1","volume-title":"The Communication Complexity of Payment Computation. CoRR, abs\/2012.14623","author":"Dobzinski Shahar","year":"2020","unstructured":"Shahar Dobzinski and Shiri Ron. 2020. The Communication Complexity of Payment Computation. CoRR, abs\/2012.14623, 2020. arxiv:2012.14623"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085115"},{"volume-title":"Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers. In the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Ezra Tomer","key":"e_1_3_2_1_39_1","unstructured":"Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, and S. Matthew Weinberg. 2019. Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers. In the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2007.09.015"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219202"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2018.12"},{"key":"e_1_3_2_1_43_1","volume-title":"On Communication Complexity of Fixed Point Computation. CoRR, abs\/1909.10958","author":"Ganor Anat","year":"2019","unstructured":"Anat Ganor, Karthik C. S., and D\u00f6m\u00f6t\u00f6r P\u00e1lv\u00f6lgyi. 2019. On Communication Complexity of Fixed Point Computation. CoRR, abs\/1909.10958, 2019. arxiv:1909.10958"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188786"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2018.10.013"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00045"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2007.12.002"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2017.09.001"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.07.006"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE1517"},{"key":"e_1_3_2_1_51_1","volume-title":"Reny","author":"Hart Sergiu","year":"2017","unstructured":"Sergiu Hart and Philip J. Reny. 2017. The Better Half of Selling Separately. CoRR, abs\/1712.08973, 2017. arxiv:1712.08973"},{"volume-title":"ACM Conference on Electronic Commerce. Pages 225\u2013234","author":"Jason","key":"e_1_3_2_1_52_1","unstructured":"Jason D. Hartline and Tim Roughgarden. 2009. Simple versus optimal mechanisms. In ACM Conference on Electronic Commerce. Pages 225\u2013234."},{"key":"e_1_3_2_1_53_1","first-page":"4","article-title":"The Use of Knowledge in Society","volume":"35","author":"Hayek F. A.","year":"1945","unstructured":"F. A. Hayek. 1945. The Use of Knowledge in Society. The American Economic Review, 35, 4, 1945. Pages 519\u2013530. issn:00028282 http:\/\/www.jstor.org\/stable\/1809376","journal-title":"The American Economic Review"},{"volume-title":"Optimality and Informational Efficiency in Resource Allocation Processes","author":"Hurwicz L.","key":"e_1_3_2_1_54_1","unstructured":"L. Hurwicz. 1960. Optimality and Informational Efficiency in Resource Allocation Processes. Stanford University Press. https:\/\/books.google.com\/books?id=p4fwtgAACAAJ"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04612-5_15"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"volume-title":"the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Kothari Pravesh","key":"e_1_3_2_1_57_1","unstructured":"Pravesh Kothari, Divyarthi Mohan, Ariel Schvartzman, Sahil Singla, and S. Matthew Weinberg. 2019. Approximation Schemes for a Buyer with Independent Items via Symmetries. In the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2005.02.006"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734017"},{"key":"e_1_3_2_1_60_1","first-page":"28","article-title":"On Revenue Maximization for Selling Multiple Independently Distributed Items","volume":"110","author":"Li Xinye","year":"2013","unstructured":"Xinye Li and Andrew Chi-Chih Yao. 2013. On Revenue Maximization for Selling Multiple Independently Distributed Items. Proceedings of the National Academy of Sciences, 110, 28, 2013. Pages 11232\u201311237.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.131"},{"key":"e_1_3_2_1_62_1","first-page":"6","article-title":"Bayesian and Dominant-Strrategy Implementation in the Independent Private-Values Model","volume":"78","author":"Manelli A. M.","year":"2010","unstructured":"A. M. Manelli and D. R. Vincent. 2010. Bayesian and Dominant-Strrategy Implementation in the Independent Private-Values Model. Econometrica, 78, 6, 2010. Pages 1905\u20131938.","journal-title":"Econometrica"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(74)90012-X"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.54"},{"key":"e_1_3_2_1_66_1","first-page":"3","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_67_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.122"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/1160633.1160727"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(84)90160-1"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229077"},{"key":"e_1_3_2_1_71_1","unstructured":"Tim Roughgarden and Omri Weinstein. 2016. On the Communication Complexity of Approximate Fixed Points.. In Electronic Colloquium on Computational Complexity (ECCC). 23 Pages 55."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840736"},{"key":"e_1_3_2_1_73_1","volume-title":"Exponential Communication Separations between Notions of Selfishness. CoRR, abs\/2012.14898","author":"Rubinstein Aviad","year":"2020","unstructured":"Aviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas, S. Matthew Weinberg, and Junyao Zhao. 2020. Exponential Communication Separations between Notions of Selfishness. CoRR, abs\/2012.14898, 2020. arxiv:2012.14898"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3105448"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.132"},{"key":"e_1_3_2_1_76_1","volume-title":"Results and Applications. Handbook of the Geometry of Banach Spaces. 2","author":"Schechtman Gideon","year":"1874","unstructured":"Gideon Schechtman. 2003. Chapter 37 - Concentration, Results and Applications. Handbook of the Geometry of Banach Spaces. 2, Elsevier Science B.V.. Pages 1603 \u2013 1634. issn:1874-5849 http:\/\/www.sciencedirect.com\/science\/article\/pii\/S187458490380044X"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2006.09.011"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE576"},{"key":"e_1_3_2_1_79_1","first-page":"602","volume-title":"International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012","author":"Travis","year":"2012","unstructured":"Travis C. Service and Julie A. Adams. 2012. Communication complexity of approximating voting rules. In International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, Valencia, Spain, June 4-8, 2012 (3 Volumes). Pages 593\u2013602. http:\/\/dl.acm.org\/citation.cfm?id=2343781"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2003.09.002"},{"key":"e_1_3_2_1_81_1","unstructured":"S. Matthew Weinberg. 2020."}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Italy","acronym":"STOC '21"},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":81,"alternative-id":["10.1145\/3406325.3451111","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451111","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}