{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T07:53:45Z","timestamp":1760255625158,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"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,7,18]]},"DOI":"10.1145\/3465456.3467570","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:45Z","timestamp":1626604125000},"page":"314-315","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Robustly-Optimal Mechanism for Selling Multiple Goods"],"prefix":"10.1145","author":[{"given":"Yeon-Koo","family":"Che","sequence":"first","affiliation":[{"name":"Columbia University, New York, NY, USA"}]},{"given":"Weijie","family":"Zhong","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Patrick Briest Shuchi Chawla Robert Kleinberg and Matthew Weinberg. 2010. Pricing Randomized Allocations. In ACM Sympsium on Discrete Algorithms . 585--597.  Patrick Briest Shuchi Chawla Robert Kleinberg and Matthew Weinberg. 2010. Pricing Randomized Allocations. In ACM Sympsium on Discrete Algorithms . 585--597.","DOI":"10.1137\/1.9781611973075.49"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA14165"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA12618"},{"key":"e_1_3_2_1_4_1","volume-title":"The Menu-Size Complexity of Auctions. In ACM Conference on Electronic Commerce . 565--566","author":"Hart Sergiu","year":"2013","unstructured":"Sergiu Hart and Noam Nisan . 2013 . The Menu-Size Complexity of Auctions. In ACM Conference on Electronic Commerce . 565--566 . Sergiu Hart and Noam Nisan. 2013. The Menu-Size Complexity of Auctions. In ACM Conference on Electronic Commerce . 565--566."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2006.12.007"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/1885625"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Budapest Hungary","acronym":"EC '21"},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467570","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:31Z","timestamp":1750191511000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":7,"alternative-id":["10.1145\/3465456.3467570","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467570","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}