{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:58Z","timestamp":1763468278112,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-1065060, CCF-1101389, CNS-1065060, CCF-1016885, CCF-1215965"],"award-info":[{"award-number":["CNS-1065060, CCF-1101389, CNS-1065060, CCF-1016885, CCF-1215965"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CNS-1065060, CCF-1101389, CNS-1065060, CCF-1016885, CCF-1215965"],"award-info":[{"award-number":["CNS-1065060, CCF-1101389, CNS-1065060, CCF-1016885, CCF-1215965"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591826","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"21-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Private matchings and allocations"],"prefix":"10.1145","author":[{"given":"Justin","family":"Hsu","sequence":"first","affiliation":[{"name":"University of Pennsylvania"}]},{"given":"Zhiyi","family":"Huang","sequence":"additional","affiliation":[{"name":"Stanford University, University of Hong Kong"}]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[{"name":"University of Pennsylvania"}]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Zhiwei Steven","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Pennsylvania"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2450142.2450148"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043621.2043626"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806787"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.87"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Dwork C. and Roth A. 2013. The algorithmic foundations of differential privacy.  Dwork C. and Roth A. 2013. The algorithmic foundations of differential privacy.","DOI":"10.1561\/9781601988195"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.1999.2531"},{"volume-title":"ACM--SIAM Symposium on Discrete Algorithms (SODA)","author":"Gupta A.","key":"e_1_3_2_2_9_1","unstructured":"Gupta , A. , Ligett , K. , Mcsherry , F. , Roth , A. , and Talwar , K . 2010. Differentially private combinatorial optimization . In ACM--SIAM Symposium on Discrete Algorithms (SODA) , Austin, Texas. 1106--1125. Gupta, A., Ligett, K., Mcsherry, F., Roth, A., and Talwar, K. 2010. Differentially private combinatorial optimization. In ACM--SIAM Symposium on Discrete Algorithms (SODA), Austin, Texas. 1106--1125."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.85"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488651"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554834"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/1913392"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509013.2509016"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Rogers R. and Roth A. 2013. Asymptotically truthful equilibrium selection in large congestion games.  Rogers R. and Roth A. 2013. Asymptotically truthful equilibrium selection in large congestion games.","DOI":"10.1145\/2600057.2602856"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York","acronym":"STOC '14"},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591826","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":17,"alternative-id":["10.1145\/2591796.2591826","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591826","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}