{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:42:32Z","timestamp":1773481352800,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,14]],"date-time":"2015-06-14T00:00:00Z","timestamp":1434240000000},"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":[[2015,6,14]]},"DOI":"10.1145\/2746539.2746597","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T15:35:56Z","timestamp":1433345756000},"page":"401-408","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension"],"prefix":"10.1145","author":[{"given":"Amit","family":"Daniely","sequence":"first","affiliation":[{"name":"Hebrew University, Jerusalem, Israel"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Hebrew University, Jerusalem, Israel"}]},{"given":"Gal","family":"Shahaf","sequence":"additional","affiliation":[{"name":"Hebrew University, Jerusalem, Israel"}]}],"member":"320","published-online":{"date-parts":[[2015,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263927"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880947"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/846241.846250"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1008"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873646"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807348"},{"key":"e_1_3_2_1_7_1","first-page":"68","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","volume":"16","author":"Buchfuhrer David","year":"2009","unstructured":"David Buchfuhrer and Christopher Umans . Limits on the social welfare of maximal-in-range auction mechanisms . In Electronic Colloquium on Computational Complexity (ECCC) , volume 16 , page 68 , 2009 . David Buchfuhrer and Christopher Umans. Limits on the social welfare of maximal-in-range auction mechanisms. In Electronic Colloquium on Computational Complexity (ECCC), volume 16, page 68, 2009."},{"key":"e_1_3_2_1_8_1","volume-title":"COLT","author":"Daniely A.","year":"2014","unstructured":"A. Daniely and S. Shalev-Shwartz . Optimal learners to multiclass problems . In COLT , 2014 . A. Daniely and S. Shalev-Shwartz. Optimal learners to multiclass problems. In COLT, 2014."},{"key":"e_1_3_2_1_9_1","volume-title":"COLT","author":"Daniely A.","year":"2011","unstructured":"A. Daniely , S. Sabato , S. Ben-David , and S. Shalev-Shwartz . Multiclass learnability and the erm principle . In COLT , 2011 . A. Daniely, S. Sabato, S. Ben-David, and S. Shalev-Shwartz. Multiclass learnability and the erm principle. In COLT, 2011."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993656"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.42"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250842"},{"key":"e_1_3_2_1_13_1","volume-title":"Citeseer","author":"Dobzinski Shahar","year":"2005","unstructured":"Shahar Dobzinski and Michael Schapira . Optimal upper and lower approximation bounds for k-duplicates combinatorial auctions. Technical report , Citeseer , 2005 . Shahar Dobzinski and Michael Schapira. Optimal upper and lower approximation bounds for k-duplicates combinatorial auctions. Technical report, Citeseer, 2005."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229044"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060681"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.02.010"},{"key":"e_1_3_2_1_17_1","volume-title":"Amplified hardness of approximation for vcg-based mechanisms. arXiv preprint arXiv:0907.1948","author":"Dughmi Shaddin","year":"2009","unstructured":"Shaddin Dughmi , Hu Fu , and Robert Kleinberg . Amplified hardness of approximation for vcg-based mechanisms. arXiv preprint arXiv:0907.1948 , 2009 . Shaddin Dughmi, Hu Fu, and Robert Kleinberg. Amplified hardness of approximation for vcg-based mechanisms. arXiv preprint arXiv:0907.1948, 2009."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(95)90001-2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0899-8256(03)00184-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"key":"e_1_3_2_1_21_1","volume-title":"Vc v. vcg: Inapproximability of combinatorial auctions via generalizations of the vc dimension. arXiv preprint arXiv:0905.1995","author":"Mossel Elchanan","year":"2009","unstructured":"Elchanan Mossel , Christos Papadimitriou , Michael Schapira , and Yaron Singer . Vc v. vcg: Inapproximability of combinatorial auctions via generalizations of the vc dimension. arXiv preprint arXiv:0905.1995 , 2009 . Elchanan Mossel, Christos Papadimitriou, Michael Schapira, and Yaron Singer. Vc v. vcg: Inapproximability of combinatorial auctions via generalizations of the vc dimension. arXiv preprint arXiv:0905.1995, 2009."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022605311895"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_74"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.54"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90019-2"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1972.41.247"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90046-8"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/211359"}],"event":{"name":"STOC '15: Symposium on Theory of Computing","location":"Portland Oregon USA","acronym":"STOC '15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-seventh annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746597","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746539.2746597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:56:04Z","timestamp":1750272964000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,14]]},"references-count":30,"alternative-id":["10.1145\/2746539.2746597","10.1145\/2746539"],"URL":"https:\/\/doi.org\/10.1145\/2746539.2746597","relation":{},"subject":[],"published":{"date-parts":[[2015,6,14]]},"assertion":[{"value":"2015-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}