{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:11Z","timestamp":1763467991134,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"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.1807348","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"33-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Computation and incentives in combinatorial public projects"],"prefix":"10.1145","author":[{"given":"Dave","family":"Buchfuhrer","sequence":"first","affiliation":[{"name":"Caltech, Pasadena, CA, USA"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, and University of California at Berkeley, Berkeley, CA, USA"}]},{"given":"Yaron","family":"Singer","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"399","volume-title":"Hardness of approximations","author":"Arora Sanjeev","year":"1997","unstructured":"Sanjeev Arora and Carsten Lund . Hardness of approximations . pages 399 -- 446 , 1997 . Sanjeev Arora and Carsten Lund. Hardness of approximations. pages 399--446, 1997."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060681"},{"key":"e_1_3_2_1_3_1","volume-title":"On characterizations of truthful mechanisms for combinatorial auctions and scheduling","author":"Dobzinski Shahar","year":"2008","unstructured":"Shahar Dobzinski and Mukund Sundararajan . On characterizations of truthful mechanisms for combinatorial auctions and scheduling , 2008 . Working paper. Shahar Dobzinski and Mukund Sundararajan. On characterizations of truthful mechanisms for combinatorial auctions and scheduling, 2008. Working paper."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132523"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.14"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873691"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946351"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501161"},{"key":"e_1_3_2_1_10_1","first-page":"73","volume-title":"An analysis of approximations for maximizing submodular set functions ii. Math. Programming Study 8","author":"Nemhauser G. L.","year":"1978","unstructured":"G. L. Nemhauser , L. A. Wolsey , and M. L. Fisher . An analysis of approximations for maximizing submodular set functions ii. Math. Programming Study 8 , pages 73 -- 87 , 1978 . G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions ii. Math. Programming Study 8, pages 73--87, 1978."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352872"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.54"},{"key":"e_1_3_2_1_14_1","volume-title":"Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization","author":"Christos","year":"1998","unstructured":"Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization ; Algorithms and Complexity. Dover Publications , 1998 . Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization; Algorithms and Complexity. Dover Publications, 1998."},{"key":"e_1_3_2_1_15_1","first-page":"321","volume-title":"Aggregation and Revelation of Preferences. Papers presented at the 1st European Summer Workshop of the","author":"Roberts Kevin","year":"1979","unstructured":"Kevin Roberts . The characterization of implementable choice rules . In Jean-Jacques Laffont, editor, Aggregation and Revelation of Preferences. Papers presented at the 1st European Summer Workshop of the Econometric Society , pages 321 -- 349 . North-Holland, 1979 . Kevin Roberts. The characterization of implementable choice rules. In Jean-Jacques Laffont, editor, Aggregation and Revelation of Preferences. Papers presented at the 1st European Summer Workshop of the Econometric Society, pages 321--349. North-Holland, 1979."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_41"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374389"}],"event":{"name":"EC '10: ACM Conference on Electronic Commerce","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Cambridge Massachusetts USA","acronym":"EC '10"},"container-title":["Proceedings of the 11th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807342.1807348","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807342.1807348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:34Z","timestamp":1750246774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807342.1807348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,7]]},"references-count":17,"alternative-id":["10.1145\/1807342.1807348","10.1145\/1807342"],"URL":"https:\/\/doi.org\/10.1145\/1807342.1807348","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"}}]}}