{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:48Z","timestamp":1750220208440,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["SES-1948692,CCF-1942583"],"award-info":[{"award-number":["SES-1948692,CCF-1942583"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Onassis Foundation Scholarship"},{"name":"Bodossaki Foundation Scholarship"},{"name":"Sloan Foundation Research Fellowship"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538304","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"608-663","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Is Selling Complete Information (Approximately) Optimal?"],"prefix":"10.1145","author":[{"given":"Dirk","family":"Bergemann","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Cai","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grigoris","family":"Velegkas","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingfei","family":"Zhao","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, 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","volume-title":"Expected value of sample information calculations in medical decision modeling. Medical decision making","author":"Ades AE","year":"2004","unstructured":"AE Ades , G Lu , and K Claxton . 2004. Expected value of sample information calculations in medical decision modeling. Medical decision making , Vol. 24 , 2 ( 2004 ), 207--227. AE Ades, G Lu, and K Claxton. 2004. Expected value of sample information calculations in medical decision modeling. Medical decision making, Vol. 24, 2 (2004), 207--227."},{"volume-title":"Functions of bounded variation and free discontinuity problems","author":"Ambrosio Luigi","key":"e_1_3_2_1_2_1","unstructured":"Luigi Ambrosio , Nicola Fusco , and Diego Pallara . 2000. Functions of bounded variation and free discontinuity problems . Courier Corporation . Luigi Ambrosio, Nicola Fusco, and Diego Pallara. 2000. Functions of bounded variation and free discontinuity problems. Courier Corporation."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1086\/710607"},{"volume-title":"the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Babaioff Moshe","key":"e_1_3_2_1_4_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)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229024"},{"volume-title":"Convexity and optimization in Banach spaces","author":"Barbu Viorel","key":"e_1_3_2_1_6_1","unstructured":"Viorel Barbu and Teodor Precupanu . 2012. Convexity and optimization in Banach spaces . Springer Science & Business Media . Viorel Barbu and Teodor Precupanu. 2012. Convexity and optimization in Banach spaces. Springer Science & Business Media."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1257\/mic.20140155"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20161079"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability","author":"Blackwell David","year":"1951","unstructured":"David Blackwell . 1951 . Comparison of Experiments . Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (1951), 99--102. David Blackwell. 1951. Comparison of Experiments. Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (1951), 99--102."},{"key":"e_1_3_2_1_10_1","volume-title":"Equivalent comparisons of experiments. The annals of mathematical statistics","author":"Blackwell David","year":"1953","unstructured":"David Blackwell . 1953. Equivalent comparisons of experiments. The annals of mathematical statistics ( 1953 ), 265--272. David Blackwell. 1953. Equivalent comparisons of experiments. The annals of mathematical statistics (1953), 265--272."},{"volume-title":"the 48th Annual ACM Symposium on Theory of Computing (STOC) .","author":"Cai Yang","key":"e_1_3_2_1_11_1","unstructured":"Yang Cai , Nikhil R. Devanur , and S. Matthew Weinberg . 2016. A Duality Based Unified Approach to Bayesian Mechanism Design . In the 48th Annual ACM Symposium on Theory of Computing (STOC) . Yang Cai, Nikhil R. Devanur, and S. Matthew Weinberg. 2016. A Duality Based Unified Approach to Bayesian Mechanism Design. In the 48th Annual ACM Symposium on Theory of Computing (STOC) ."},{"key":"e_1_3_2_1_12_1","volume-title":"12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6--8, 2021, Virtual Conference (LIPIcs)","volume":"185","author":"Cai Yang","year":"2021","unstructured":"Yang Cai and Grigoris Velegkas . 2021 . How to Sell Information Optimally: An Algorithmic Study . In 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6--8, 2021, Virtual Conference (LIPIcs) , Vol. 185 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 81:1--81:20. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS. 2021.81 10.4230\/LIPIcs.ITCS.2021.81 Yang Cai and Grigoris Velegkas. 2021. How to Sell Information Optimally: An Algorithmic Study. In 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6--8, 2021, Virtual Conference (LIPIcs), Vol. 185. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 81:1--81:20. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2021.81"},{"key":"e_1_3_2_1_13_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_14_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_15_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_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.148"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/1913096"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA12618"},{"key":"e_1_3_2_1_19_1","volume-title":"Optimal Mechanism Design for Single-Minded Agents. arXiv preprint arXiv:2002.06329","author":"Devanur Nikhil","year":"2020","unstructured":"Nikhil Devanur , Kira Goldner , Raghuvansh Saxena , Ariel Schvartzman , and S Matthew Weinberg . 2020. Optimal Mechanism Design for Single-Minded Agents. arXiv preprint arXiv:2002.06329 ( 2020 ). Nikhil Devanur, Kira Goldner, Raghuvansh Saxena, Ariel Schvartzman, and S Matthew Weinberg. 2020. Optimal Mechanism Design for Single-Minded Agents. arXiv preprint arXiv:2002.06329 (2020)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085132"},{"key":"e_1_3_2_1_21_1","volume-title":"Why perfect tests may not be worth waiting for: Information as a commodity. Available at SSRN 3565245","author":"Drakopoulos Kimon","year":"2020","unstructured":"Kimon Drakopoulos and Ramandeep S Randhawa . 2020. Why perfect tests may not be worth waiting for: Information as a commodity. Available at SSRN 3565245 ( 2020 ). Kimon Drakopoulos and Ramandeep S Randhawa. 2020. Why perfect tests may not be worth waiting for: Information as a commodity. Available at SSRN 3565245 (2020)."},{"key":"e_1_3_2_1_22_1","volume-title":"61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020","author":"Paul D\u00fc","year":"2020","unstructured":"Paul D\u00fc tting, Thomas Kesselheim , and Brendan Lucier . 2020 . An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions . In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020 , Durham, NC, USA, November 16--19 , 2020. IEEE, 306--317. https:\/\/doi.org\/10.1109\/FOCS46700.2020.00037 10.1109\/FOCS46700.2020.00037 Paul D\u00fc tting, Thomas Kesselheim, and Brendan Lucier. 2020. An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16--19, 2020. IEEE, 306--317. https:\/\/doi.org\/10.1109\/FOCS46700.2020.00037"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2021.105236"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940752"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602883"},{"key":"e_1_3_2_1_26_1","volume-title":"42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6--10, 2015, Proceedings, Part II. 650--662","author":"Giannakopoulos Yiannis","year":"2015","unstructured":"Yiannis Giannakopoulos and Elias Koutsoupias . 2015 . Selling Two Goods Optimally. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6--10, 2015, Proceedings, Part II. 650--662 . https:\/\/doi.org\/10.1007\/978--3--662--47666--6_52 10.1007\/978--3--662--47666--6_52 Yiannis Giannakopoulos and Elias Koutsoupias. 2015. Selling Two Goods Optimally. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6--10, 2015, Proceedings, Part II. 650--662. https:\/\/doi.org\/10.1007\/978--3--662--47666--6_52"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/restud\/rdaa053"},{"key":"e_1_3_2_1_28_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_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.07.006"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_3_2_1_31_1","volume-title":"Selling Data to an Agent with Endogenous Information. arXiv preprint arXiv:2103.05788","author":"Yingkai Li.","year":"2021","unstructured":"Yingkai Li. 2021. Selling Data to an Agent with Endogenous Information. arXiv preprint arXiv:2103.05788 ( 2021 ). Yingkai Li. 2021. Selling Data to an Agent with Endogenous Information. arXiv preprint arXiv:2103.05788 (2021)."},{"volume-title":"Optimal Pricing of Information","author":"Liu Shuze","key":"e_1_3_2_1_32_1","unstructured":"Shuze Liu , Weiran Shen , and Haifeng Xu. 2021. Optimal Pricing of Information . Association for Computing Machinery , New York, NY, USA , 693. https:\/\/doi.org\/10.1145\/3465456.3467551 10.1145\/3465456.3467551 Shuze Liu, Weiran Shen, and Haifeng Xu. 2021. Optimal Pricing of Information. Association for Computing Machinery, New York, NY, USA, 693. https:\/\/doi.org\/10.1145\/3465456.3467551"},{"volume-title":"Optimization by vector space methods","author":"Luenberger David G","key":"e_1_3_2_1_33_1","unstructured":"David G Luenberger . 1997. Optimization by vector space methods . John Wiley & Sons . David G Luenberger. 1997. Optimization by vector space methods. John Wiley & Sons."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.2307\/1885625"},{"key":"e_1_3_2_1_36_1","volume-title":"sweeping, and multidimensional screening. Econometrica","author":"Rochet Jean-Charles","year":"1998","unstructured":"Jean-Charles Rochet and Philippe Chon\u00e9 . 1998. Ironing , sweeping, and multidimensional screening. Econometrica ( 1998 ), 783--826. Jean-Charles Rochet and Philippe Chon\u00e9. 1998. Ironing, sweeping, and multidimensional screening. Econometrica (1998), 783--826."},{"volume-title":"Stochastic orders","author":"Shaked Moshe","key":"e_1_3_2_1_37_1","unstructured":"Moshe Shaked and J George Shanthikumar . 2007. Stochastic orders . Springer . Moshe Shaked and J George Shanthikumar. 2007. Stochastic orders .Springer."},{"key":"e_1_3_2_1_38_1","unstructured":"Carl Shapiro Shapiro Carl Hal R Varian etal 1998. Information rules: a strategic guide to the network economy. Harvard Business Press.  Carl Shapiro Shapiro Carl Hal R Varian et al. 1998. Information rules: a strategic guide to the network economy. Harvard Business Press."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2011.06.003"},{"volume-title":"Optimal transport: old and new","author":"Villani C\u00e9dric","key":"e_1_3_2_1_40_1","unstructured":"C\u00e9dric Villani . 2009. Optimal transport: old and new . Vol. 338 . Springer . C\u00e9dric Villani. 2009. Optimal transport: old and new. Vol. 338. Springer."},{"key":"e_1_3_2_1_41_1","volume-title":"SODA. CoRR","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 SODA. CoRR ( 2015 ). http:\/\/arxiv.org\/abs\/1406.3278 Andrew Chi-Chih Yao. 2015. An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications, In SODA. CoRR (2015). http:\/\/arxiv.org\/abs\/1406.3278"}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Boulder CO USA","acronym":"EC '22"},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538304","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538304","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.3538304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":41,"alternative-id":["10.1145\/3490486.3538304","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538304","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"}}]}}