{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T18:32:05Z","timestamp":1775845925407,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,7]],"date-time":"2010-06-07T00:00:00Z","timestamp":1275868800000},"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":[[2010,6,7]]},"DOI":"10.1145\/1807342.1807393","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"315-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":92,"title":["Asymptotically optimal strategy-proof mechanisms for two-facility games"],"prefix":"10.1145","author":[{"given":"Pinyan","family":"Lu","sequence":"first","affiliation":[{"name":"Microsoft Reseaerch Asia, Beijing, China"}]},{"given":"Xiaorui","family":"Sun","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"given":"Yajun","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Zeyuan Allen","family":"Zhu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2010,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Strategyproof approximation mechanisms for location on networks. CoRR, abs\/0907.2049","author":"Alon N.","year":"2009","unstructured":"N. Alon , M. Feldman , A. D. Procaccia , and M. Tennenholtz . Strategyproof approximation mechanisms for location on networks. CoRR, abs\/0907.2049 , 2009 . N. Alon, M. Feldman, A. D. Procaccia, and M. Tennenholtz. Strategyproof approximation mechanisms for location on networks. CoRR, abs\/0907.2049, 2009."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875583"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003550100151"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00193809"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01832918"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1086\/256633"},{"key":"e_1_3_2_1_7_1","first-page":"1163","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Christodoulou G.","year":"2007","unstructured":"G. Christodoulou , E. Koutsoupias , and A. Vidali . A lower bound for scheduling mechanisms . In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 1163 -- 1170 , 2007 . G. Christodoulou, E. Koutsoupias, and A. Vidali. A lower bound for scheduling mechanisms. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1163--1170, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01726210"},{"key":"e_1_3_2_1_9_1","first-page":"884","volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Dekel O.","year":"2008","unstructured":"O. Dekel , F. Fischer , and A.D. Procaccia . Incentive compatible regression learning . In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 884 -- 893 , 2008 . O. Dekel, F. Fischer, and A.D. Procaccia. Incentive compatible regression learning. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 884--893, 2008."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.71"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914083"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392236.2392293"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.76"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_14"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_46"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00128122"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566401"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(75)90050-2"},{"key":"e_1_3_2_1_23_1","first-page":"104","article-title":"Strategy-proof location on a network","author":"Schummer J.","year":"2001","unstructured":"J. Schummer and R. V. Vohra . Strategy-proof location on a network . Journal of Economic Theory , 104 , 2001 . J. Schummer and R. V. Vohra. Strategy-proof location on a network. Journal of Economic Theory, 104, 2001.","journal-title":"Journal of Economic Theory"},{"key":"e_1_3_2_1_24_1","volume-title":"Mechanism design without money","author":"Schummer J.","year":"2007","unstructured":"J. Schummer and R. V. Vohra . Mechanism design without money , chapter 10. Cambridge University Press , 2007 . J. Schummer and R. V. Vohra. Mechanism design without money, chapter 10. Cambridge University Press, 2007."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/2938268"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"event":{"name":"EC '10: ACM Conference on Electronic Commerce","location":"Cambridge Massachusetts USA","acronym":"EC '10","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 11th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807342.1807393","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807342.1807393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:30Z","timestamp":1750246770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807342.1807393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,7]]},"references-count":26,"alternative-id":["10.1145\/1807342.1807393","10.1145\/1807342"],"URL":"https:\/\/doi.org\/10.1145\/1807342.1807393","relation":{},"subject":[],"published":{"date-parts":[[2010,6,7]]},"assertion":[{"value":"2010-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}