{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T03:39:54Z","timestamp":1775705994081,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"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.1807394","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"325-334","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Truthful assignment without money"],"prefix":"10.1145","author":[{"given":"Shaddin","family":"Dughmi","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpita","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","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","unstructured":"N. Alon F. Fischer A. D. Procaccia and M. Tennenholtz. Sum of us: Strategyproof selection from the selectors. Working paper 2009.  N. Alon F. Fischer A. D. Procaccia and M. Tennenholtz. Sum of us: Strategyproof selection from the selectors. Working paper 2009."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875583"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807392"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_68"},{"key":"e_1_3_2_1_6_1","volume-title":"Athena Scientific","author":"Bertsekas D.","year":"1998"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060597"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"E. Budish. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Working paper 2009.  E. Budish. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Working paper 2009.","DOI":"10.1145\/1807406.1807480"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_5"},{"key":"e_1_3_2_1_10_1","first-page":"213","volume-title":"SODA","author":"Chekuri C.","year":"2000"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.14"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109624"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946351"},{"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.1287\/moor.6.1.58"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1296179"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566401"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585178"},{"key":"e_1_3_2_1_19_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.1807394","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807342.1807394","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.1807394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,7]]},"references-count":19,"alternative-id":["10.1145\/1807342.1807394","10.1145\/1807342"],"URL":"https:\/\/doi.org\/10.1145\/1807342.1807394","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"}}]}}