{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:04:28Z","timestamp":1778493868864,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":28,"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":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2113798"],"award-info":[{"award-number":["CCF-2113798"]}],"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":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538335","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"477-496","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Price Discrimination for Randomized Mechanisms"],"prefix":"10.1145","author":[{"given":"Shao-Heng","family":"Ko","sequence":"first","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamesh","family":"Munagala","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. DoubleClick Ad Exchange. https:\/\/static.googleusercontent.com\/media\/www.google.com\/en\/\/adexchange\/AdExchangeOverview.pdf.  [n.d.]. DoubleClick Ad Exchange. https:\/\/static.googleusercontent.com\/media\/www.google.com\/en\/\/adexchange\/AdExchangeOverview.pdf."},{"key":"e_1_3_2_1_2_1","unstructured":"[n.d.]. Microsoft Ad Exchange. https:\/\/ads.microsoft.com\/.  [n.d.]. Microsoft Ad Exchange. https:\/\/ads.microsoft.com\/."},{"key":"e_1_3_2_1_3_1","unstructured":"[n.d.]. Pubmatic Ad Exchange. https:\/\/pubmatic.com\/.  [n.d.]. Pubmatic Ad Exchange. https:\/\/pubmatic.com\/."},{"key":"e_1_3_2_1_4_1","unstructured":"[n.d.]. Yahoo Ad Exchange. https:\/\/policies.yahoo.com\/us\/en\/yahoo\/terms\/yahooadexchange\/index.htm.  [n.d.]. Yahoo Ad Exchange. https:\/\/policies.yahoo.com\/us\/en\/yahoo\/terms\/yahooadexchange\/index.htm."},{"key":"e_1_3_2_1_5_1","volume-title":"The Limits of an Information Intermediary in Auction Design. CoRR abs\/2009.11841","author":"Alijani Reza","year":"2020","unstructured":"Reza Alijani , Siddhartha Banerjee , Kamesh Munagala , and Kangning Wang . 2020. The Limits of an Information Intermediary in Auction Design. CoRR abs\/2009.11841 ( 2020 ). Reza Alijani, Siddhartha Banerjee, Kamesh Munagala, and Kangning Wang. 2020. The Limits of an Information Intermediary in Auction Design. CoRR abs\/2009.11841 (2020)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467574"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20130848"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1257\/jel.20181489"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1100113"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3379478"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2805184.2805190"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993613"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1999.2639"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.149"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 2017 ACM Conference on Economics and Computation. 39--40","author":"Devanur Nikhil R.","unstructured":"Nikhil R. Devanur and S. Matthew Weinberg . 2017. The Optimal Mechanism for Selling to a Budget Constrained Buyer: The General Case . In Proceedings of the 2017 ACM Conference on Economics and Computation. 39--40 . Nikhil R. Devanur and S. Matthew Weinberg. 2017. The Optimal Mechanism for Selling to a Budget Constrained Buyer: The General Case. In Proceedings of the 2017 ACM Conference on Economics and Computation. 39--40."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055589.3055591"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940781"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1098334"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940752"},{"key":"e_1_3_2_1_20_1","unstructured":"Nima Haghpanah and R. Siegel. 2020. Pareto Improving Segmentation of Multi-product Markets.  Nima Haghpanah and R. Siegel. 2020. Pareto Improving Segmentation of Multi-product Markets."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.101.6.2590"},{"key":"e_1_3_2_1_22_1","unstructured":"Shao-Heng Ko and Kamesh Munagala. 2022. Optimal Price Discrimination for Randomized Mechanisms. https:\/\/arxiv.org\/abs\/2205.04687.  Shao-Heng Ko and Kamesh Munagala. 2022. Optimal Price Discrimination for Randomized Mechanisms. https:\/\/arxiv.org\/abs\/2205.04687."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-1765(96)00849-X"},{"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\/3105448"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. 2026--2035","author":"Saxena Raghuvansh R.","unstructured":"Raghuvansh R. Saxena , Ariel Schvartzman , and S. Matthew Weinberg . 2018. The menu complexity of \"one-and-a-half-dimensional\" mechanism design . In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. 2026--2035 . Raghuvansh R. Saxena, Ariel Schvartzman, and S. Matthew Weinberg. 2018. The menu complexity of \"one-and-a-half-dimensional\" mechanism design. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. 2026--2035."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. 1531--1539","author":"Shen Weiran","year":"2018","unstructured":"Weiran Shen , Pingzhong Tang , and Yulong Zeng . 2018 . A closed-form characterization of buyer signaling schemes in monopoly pricing . In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. 1531--1539 . Weiran Shen, Pingzhong Tang, and Yulong Zeng. 2018. A closed-form characterization of buyer signaling schemes in monopoly pricing. In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. 1531--1539."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9290"}],"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.3538335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538335","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538335","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.3538335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":28,"alternative-id":["10.1145\/3490486.3538335","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538335","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"}}]}}