{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T18:09:02Z","timestamp":1763057342419,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,11]],"date-time":"2006-06-11T00:00:00Z","timestamp":1149984000000},"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":[[2006,6,11]]},"DOI":"10.1145\/1134707.1134709","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"8-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["A sufficient condition for truthfulness with single parameter agents"],"prefix":"10.1145","author":[{"given":"Nir","family":"Andelman","sequence":"first","affiliation":[{"name":"Tel-Aviv University"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[{"name":"Tel-Aviv University"}]}],"member":"320","published-online":{"date-parts":[[2006,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875583"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007942"},{"key":"e_1_3_2_1_6_1","first-page":"213","volume-title":"Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Chekuri C.","year":"2000","unstructured":"C. Chekuri and S. Khanna . A ptas for the multiple knapsack problem . In Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 213 -- 222 , 2000 . C. Chekuri and S. Khanna. A ptas for the multiple knapsack problem. In Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 213--222, 2000."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01726210"},{"key":"e_1_3_2_1_8_1","volume-title":"Computers and Intractability: a Guide to the Theory of NP-completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: a Guide to the Theory of NP-completeness . Freeman , San- Francisco , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: a Guide to the Theory of NP-completeness. Freeman, San-Francisco, 1979."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_10_1","unstructured":"H. Gui R. M\u00fcller and R. V. Vohra. Dominant strategy mechanisms with multidimensional types. working paper.  H. Gui R. M\u00fcller and R. V. Vohra. Dominant strategy mechanisms with multidimensional types. working paper."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217033"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321951"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_55"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946351"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501161"},{"key":"e_1_3_2_1_16_1","volume-title":"Microeconomic Theory","author":"Mas-Colell A.","year":"1995","unstructured":"A. Mas-Colell , M. D. Whinston , and J. R. Green . Microeconomic Theory . Oxford University press , 1995 . A. Mas-Colell, M. D. Whinston, and J. R. Green. Microeconomic Theory. Oxford University press, 1995."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0047-2727(76)90047-5"},{"key":"e_1_3_2_1_18_1","first-page":"379","volume-title":"Proc. 18th National Conf. on Artificial Intelligence and 14th Conf. on Innovative Applications of Artificial Intelligence (AAAI\/IAAI)","author":"Mu\u00e1lem A.","year":"2002","unstructured":"A. Mu\u00e1lem and N. Nisan . Truthful approximation mechanisms for restricted combinatorial auctions . In Proc. 18th National Conf. on Artificial Intelligence and 14th Conf. on Innovative Applications of Artificial Intelligence (AAAI\/IAAI) , pages 379 -- 384 , 2002 . A. Mu\u00e1lem and N. Nisan. Truthful approximation mechanisms for restricted combinatorial auctions. In Proc. 18th National Conf. on Artificial Intelligence and 14th Conf. on Innovative Applications of Artificial Intelligence (AAAI\/IAAI), pages 379--384, 2002."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301287"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352898"},{"key":"e_1_3_2_1_21_1","first-page":"321","volume-title":"Aggregation and Revelation of Preferences","author":"Roberts K.","year":"1979","unstructured":"K. Roberts . The characterization of implementable choice rules. In J. J. Laffont, editor , Aggregation and Revelation of Preferences , pages 321 -- 348 . North Holland , 1979 . K. Roberts. The characterization of implementable choice rules. In J. J. Laffont, editor, Aggregation and Revelation of Preferences, pages 321--348. North Holland, 1979."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4068(87)90007-3"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064040"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585178"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(74)90098-2"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"event":{"name":"EC06: ACM Conference on Electronic Commerce","sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"],"location":"Ann Arbor Michigan USA","acronym":"EC06"},"container-title":["Proceedings of the 7th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1134707.1134709","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1134707.1134709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:27Z","timestamp":1750259667000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1134707.1134709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,11]]},"references-count":25,"alternative-id":["10.1145\/1134707.1134709","10.1145\/1134707"],"URL":"https:\/\/doi.org\/10.1145\/1134707.1134709","relation":{},"subject":[],"published":{"date-parts":[[2006,6,11]]},"assertion":[{"value":"2006-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}