{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T04:06:19Z","timestamp":1785038779982,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"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":[[2013,6,16]]},"DOI":"10.1145\/2492002.2482593","type":"proceedings-article","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T16:03:50Z","timestamp":1370966630000},"page":"269-286","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Mechanism design via optimal transport"],"prefix":"10.1145","author":[{"given":"Constantinos","family":"Daskalakis","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Deckelbaum","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229017"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806743"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214021"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.88"},{"key":"e_1_3_2_1_5_1","volume-title":"the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Cai Y.","unstructured":"Cai , Y. , Daskalakis , C. , and Weinberg , S. M . 2013. Reducing Revenue to Welfare Maximization : Approximation Algorithms and other Generalizations . In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Cai, Y., Daskalakis, C., and Weinberg, S. M. 2013. Reducing Revenue to Welfare Maximization : Approximation Algorithms and other Generalizations. In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_6_1","volume-title":"Simple and Nearly Optimal Multi-Item Auctions. In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Cai Y.","unstructured":"Cai , Y. and Huang , Z . 2013 . Simple and Nearly Optimal Multi-Item Auctions. In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Cai, Y. and Huang, Z. 2013. Simple and Nearly Optimal Multi-Item Auctions. In the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/1913096"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"DaskalakisDT13 Daskalakis C. Deckelbaum A. and Tzamos C. 2013. The complexity of optimal mechanism design. Manuscript.  DaskalakisDT13 Daskalakis C. Deckelbaum A. and Tzamos C. 2013. The complexity of optimal mechanism design. Manuscript.","DOI":"10.1137\/1.9781611973402.96"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229042"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229061"},{"key":"e_1_3_2_1_11_1","unstructured":"Hart S. and Reny P. 2011. Maximizing revenue with multiple goods: Some examples. Manuscript.  Hart S. and Reny P. 2011. Maximizing revenue with multiple goods: Some examples. Manuscript."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v4-1005"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2005.08.007"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2006.12.007"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(88)90135-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2003.09.002"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9"}],"event":{"name":"EC '13: ACM Conference on Electronic Commerce","location":"Philadelphia Pennsylvania USA","acronym":"EC '13","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the fourteenth ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482593","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2492002.2482593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:11Z","timestamp":1750235951000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2492002.2482593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":18,"alternative-id":["10.1145\/2492002.2482593","10.1145\/2492002"],"URL":"https:\/\/doi.org\/10.1145\/2492002.2482593","relation":{},"subject":[],"published":{"date-parts":[[2013,6,16]]},"assertion":[{"value":"2013-06-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}