{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:07:23Z","timestamp":1774620443116,"version":"3.50.1"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["327620-09"],"award-info":[{"award-number":["327620-09"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p>\n            We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any\n            <jats:italic>\u03b1<\/jats:italic>\n            -approximation algorithm that also bounds the integrality gap of the LP relaxation of the problem by\n            <jats:italic>\u03b1<\/jats:italic>\n            can be used to construct an\n            <jats:italic>\u03b1<\/jats:italic>\n            -approximation mechanism that is truthful in expectation. This immediately yields a variety of new and significantly improved results for various problem domains and furthermore, yields truthful (in expectation) mechanisms with guarantees that match the best-known approximation guarantees when truthfulness is not required. In particular, we obtain the first truthful mechanisms with approximation guarantees for a variety of multiparameter domains. We obtain truthful (in expectation) mechanisms achieving approximation guarantees of\n            <jats:italic>O<\/jats:italic>\n            (\u221a\n            <jats:italic>m<\/jats:italic>\n            ) for combinatorial auctions (CAs), (1 +\n            <jats:italic>\u03f5<\/jats:italic>\n            ) for multiunit CAs with\n            <jats:italic>B<\/jats:italic>\n            =\n            <jats:italic>\u03a9<\/jats:italic>\n            (log\n            <jats:italic>m<\/jats:italic>\n            ) copies of each item, and 2 for multiparameter knapsack problems (multi-unit auctions).\n          <\/jats:p>\n          <jats:p>\n            Our construction is based on considering an LP relaxation of the problem and using the classic VCG mechanism to obtain a truthful mechanism in this fractional domain. We argue that the (fractional) optimal solution scaled down by\n            <jats:italic>\u03b1<\/jats:italic>\n            , where\n            <jats:italic>\u03b1<\/jats:italic>\n            is the integrality gap of the problem, can be represented as a convex combination of integer solutions, and by viewing this convex combination as specifying a probability distribution over integer solutions, we get a randomized, truthful in expectation mechanism. Our construction can be seen as a way of exploiting VCG in a computational tractable way even when the underlying social-welfare maximization problem is\n            <jats:italic>NP<\/jats:italic>\n            -hard.\n          <\/jats:p>","DOI":"10.1145\/2049697.2049699","type":"journal-article","created":{"date-parts":[[2011,12,13]],"date-time":"2011-12-13T15:45:47Z","timestamp":1323791147000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":86,"title":["Truthful and Near-Optimal Mechanism Design via Linear Programming"],"prefix":"10.1145","volume":"58","author":[{"given":"Ron","family":"Lavi","sequence":"first","affiliation":[{"name":"Technion -- Israel Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaitanya","family":"Swamy","sequence":"additional","affiliation":[{"name":"University of Waterloo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,12]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, 205--214","author":"Archer A.","year":"2003"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875583"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462153.1462157"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/846241.846250"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064013"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060597"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10033"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060618"},{"key":"e_1_2_1_9_1","unstructured":"Chv\u00e1tal V. 1983. Linear Programming. WH Freeman. Chv\u00e1tal V. 1983. Linear Programming . WH Freeman."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01726210"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988824"},{"key":"e_1_2_1_12_1","unstructured":"d\u2019Atri G. 1977. The generalized knapsack problem. Communication at the Annual meeting of CNR-GNIM Rimini Italy. d\u2019Atri G. 1977. The generalized knapsack problem. Communication at the Annual meeting of CNR-GNIM Rimini Italy."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_7"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 505--514","author":"Dobzinski S."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250960"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060681"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132607"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807394"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 6th Workshop on Internet and Network Economics (WINE). ACM, 462--472","author":"Elbassioni K."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250936"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989520"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Kellerer H. Pferschy U. and Pisinger D. 2004. Knapsack Problems. Springer-Verlag. Kellerer H. Pferschy U. and Pisinger D. 2004. Knapsack Problems . Springer-Verlag.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0370-6"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779948"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.76"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2008.08.001"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 574--583","author":"Lavi R."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.339"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2005.02.006"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684594"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90003-7"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2049697.2049699","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2049697.2049699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:41Z","timestamp":1750278401000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2049697.2049699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":36,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1145\/2049697.2049699"],"URL":"https:\/\/doi.org\/10.1145\/2049697.2049699","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]},"assertion":[{"value":"2010-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}