{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:27Z","timestamp":1750308567042,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T00:00:00Z","timestamp":1434326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["VO 889\/4-1"],"award-info":[{"award-number":["VO 889\/4-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,15]]},"DOI":"10.1145\/2764468.2764503","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"415-432","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Truthful Mechanism Design via Correlated Tree Rounding"],"prefix":"10.1145","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idan","family":"Maor","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rebecca","family":"Reiffenh\u00e4user","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6,15]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1316-9"},{"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.1287\/moor.1110.0534"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.02.003"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Blumrosen L. and Nisan N. 2007. Combinatorial auctions. In Algorithmic Game Theory N. Nisan \u00c9. Tardos T. Roughgarden and V. Vazirani Eds. Cambridge University Press Chapter 11.  Blumrosen L. and Nisan N. 2007. Combinatorial auctions. In Algorithmic Game Theory N. Nisan \u00c9. Tardos T. Roughgarden and V. Vazirani Eds. Cambridge University Press Chapter 11.","DOI":"10.1017\/CBO9780511800481.013"},{"volume-title":"Proc. 21st Symp. Discrete Algorithms (SODA). 518--536","author":"Buchfuhrer D.","key":"e_1_3_2_1_7_1","unstructured":"Buchfuhrer , D. , Dughmi , S. , Fu , H. , Kleinberg , R. , Mossel , E. , Papadimitriou , C. , Schapira , M. , Singer , Y. , and Umans , C . 2010. Inapproximability for VCG-based combinatorial auctions . In Proc. 21st Symp. Discrete Algorithms (SODA). 518--536 . Buchfuhrer, D., Dughmi, S., Fu, H., Kleinberg, R., Mossel, E., Papadimitriou, C., Schapira, M., Singer, Y., and Umans, C. 2010. Inapproximability for VCG-based combinatorial auctions. In Proc. 21st Symp. Discrete Algorithms (SODA). 518--536."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/080735503"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0625"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721854"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9165-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/120866038"},{"key":"e_1_3_2_1_13_1","volume-title":"Eds","author":"Cramton P.","year":"2006","unstructured":"Cramton , P. , Shoham , Y. , and Steinberg , R. , Eds . 2006 . Combinatorial Auctions. MIT Press . Cramton, P., Shoham, Y., and Steinberg, R., Eds. 2006. Combinatorial Auctions. MIT Press."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.71"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993656"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/090780146"},{"key":"e_1_3_2_1_17_1","unstructured":"Dobzinski S. Fu H. and Kleinberg R. 2010. Truthfulness via proxies. CoRR abs\/1011.3232.  Dobzinski S. Fu H. and Kleinberg R. 2010. Truthfulness via proxies. CoRR abs\/1011.3232."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-011-2528-4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229044"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214076"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807394"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993657"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.64"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627907"},{"volume-title":"Proc. 10th Intl. Conf. Web and Internet Economics (WINE). 247--248","author":"Fadaei S.","key":"e_1_3_2_1_25_1","unstructured":"Fadaei , S. and Bichler , M . 2014. A truthful-in-expectation mechanism for the generalized assignment problem . In Proc. 10th Intl. Conf. Web and Internet Economics (WINE). 247--248 . Fadaei, S. and Bichler, M. 2014. A truthful-in-expectation mechanism for the generalized assignment problem. In Proc. 10th Intl. Conf. Web and Internet Economics (WINE). 247--248."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.14"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0499"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217033"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9105-7"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9634-6"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_55"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_56"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049699"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_5"},{"volume-title":"Proc. 25th Symp. Theoret. Aspects of Computer Science (STACS). 527--538","author":"Lu P.","key":"e_1_3_2_1_37_1","unstructured":"Lu , P. and Yu , C . 2008a. An improved randomized truthful mechanism for scheduling unrelated machines . In Proc. 25th Symp. Theoret. Aspects of Computer Science (STACS). 527--538 . Lu, P. and Yu, C. 2008a. An improved randomized truthful mechanism for scheduling unrelated machines. In Proc. 25th Symp. Theoret. Aspects of Computer Science (STACS). 527--538."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_46"},{"volume-title":"Putting Auction Theory to Work","author":"Milgrom P.","key":"e_1_3_2_1_39_1","unstructured":"Milgrom , P. 2004. Putting Auction Theory to Work . Cambridge University Press . Milgrom, P. 2004. Putting Auction Theory to Work. Cambridge University Press."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386805"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585178"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.20.3.583"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374389"}],"event":{"name":"EC '15: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Portland Oregon USA","acronym":"EC '15"},"container-title":["Proceedings of the Sixteenth ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2764468.2764503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:20Z","timestamp":1750273460000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764468.2764503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,15]]},"references-count":43,"alternative-id":["10.1145\/2764468.2764503","10.1145\/2764468"],"URL":"https:\/\/doi.org\/10.1145\/2764468.2764503","relation":{},"subject":[],"published":{"date-parts":[[2015,6,15]]},"assertion":[{"value":"2015-06-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}