{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:51:14Z","timestamp":1744217474555},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00493-011-2528-4","type":"journal-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T16:46:49Z","timestamp":1321462009000},"page":"379-396","source":"Crossref","is-referenced-by-count":14,"title":["Limitations of VCG-based mechanisms"],"prefix":"10.1007","volume":"31","author":[{"given":"Shahar","family":"Dobzinski","sequence":"first","affiliation":[]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,16]]},"reference":[{"key":"2528_CR1","unstructured":"A. Archer, C. Papadimitriou, K. Talwar and E. Tardos: An approximate truthful mechanism for combinatorial auctions with single parameter agent, in: SODA\u201903."},{"issue":"5","key":"2528_CR2","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Sanjeev Arora: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, Journal of the ACM 45(5) (1998), 753\u2013782.","journal-title":"Journal of the ACM"},{"key":"2528_CR3","unstructured":"Moshe Babaioff and Liad Blumrosen: Computationally-feasible auctions for convex bundles, in: 7th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). LNCS Vol. 3122. (2004), 27\u201338."},{"key":"2528_CR4","unstructured":"Yair Bartal, Rica Gonen and Noam Nisan: Incentive compatible multi unit combinatorial auctions, in: TARK 03."},{"key":"2528_CR5","unstructured":"Liad Blumrosen and Shahar Dobzinski: Welfare maximization in congestion games, in: IEEE Journal on Selected Areas in Communications, Preliminary version in EC\u201906."},{"key":"2528_CR6","unstructured":"Liad Blumrosen and Noam Nisan: Combinatorial Auctions (a survey), in: Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos and V. Vazirani, editors."},{"key":"2528_CR7","doi-asserted-by":"crossref","unstructured":"E. H. Clarke: Multipart pricing of public goods, Public Choice (1971), 17\u201333.","DOI":"10.1007\/BF01726210"},{"key":"2528_CR8","unstructured":"Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi and Tim Roughgarden: Truthful approximation schemes for single-parameter agents, in: FOCS\u201908."},{"key":"2528_CR9","unstructured":"Shahar Dobzinski and Noam Nisan: Limitations of vcg-based mechanisms, preliminary version in: STOC\u201907."},{"key":"2528_CR10","unstructured":"Shahar Dobzinski and Noam Nisan: Mechanisms for multi-unit auctions, in: EC\u201907."},{"key":"2528_CR11","unstructured":"Shahar Dobzinski, Noam Nisan and Michael Schapira: Approximation algorithms for combinatorial auctions with complement-free bidders, in: STOC\u201905."},{"key":"2528_CR12","unstructured":"Shahar Dobzinski, Noam Nisan and Michael Schapira: Truthful randomized mechanisms for combinatorial auctions, in: STOC\u201906."},{"key":"2528_CR13","unstructured":"Shahar Dobzinski and Michael Schapira: An improved approximation algorithm for combinatorial auctions with submodular bidders, in: SODA\u201906."},{"key":"2528_CR14","unstructured":"Uriel Feige: On maximizing welfare where the utility functions are subadditive, in: STOC\u201906."},{"key":"2528_CR15","unstructured":"Uriel Feige and Jan Vondrak: Approximation algorithms for allocation problems: Improving the factor of 1\u22121\/e, in: FOCS\u201906."},{"key":"2528_CR16","doi-asserted-by":"crossref","unstructured":"T. Groves: Incentives in teams, Econometrica (1073), 617\u2013631.","DOI":"10.2307\/1914085"},{"key":"2528_CR17","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/S0899-8256(03)00184-2","volume":"47","author":"R. Holzman","year":"2004","unstructured":"Ron Holzman, Noa Kfir-Dahav, Dov Monderer and Moshe Tennenholtz: Bundling equilibrium in combinatrial auctions, Games and Economic Behavior 47 (2004), 104\u2013123.","journal-title":"Games and Economic Behavior"},{"key":"2528_CR18","doi-asserted-by":"crossref","unstructured":"Subhash Khot, Richard J. Lipton, Evangelos Markakis and Aranyak Mehta: Inapproximability results for combinatorial auctions with submodular utility functions, in: WINE\u201905, 2005.","DOI":"10.1007\/11600930_10"},{"key":"2528_CR19","doi-asserted-by":"crossref","unstructured":"Eyal Kushilevitz and Noam Nisan: Communication Complexity, Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574948"},{"key":"2528_CR20","unstructured":"Ron Lavi, Ahuva Mu\u2019alem and Noam Nisan: Towards a characterization of truthful combinatorial auctions, in: FOCS\u201903."},{"key":"2528_CR21","unstructured":"Ron Lavi and Chaitanya Swamy: Truthful and near-optimal mechanism design via linear programming, in: FOCS 2005."},{"key":"2528_CR22","unstructured":"Benny Lehmann, Daniel Lehmann and Noam Nisan: Combinatorial auctions with decreasing marginal utilities, in: EC\u201901."},{"issue":"5","key":"2528_CR23","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D. Lehmann","year":"2002","unstructured":"Daniel Lehmann, Liadan Ita O\u2019Callaghan and Yoav Shoham: Truth revelation in approximately efficient combinatorial auctions, in: JACM 49(5) (Sept. 2002), 577\u2013602.","journal-title":"JACM"},{"key":"2528_CR24","unstructured":"A. Mas-Collel, W. Whinston and J. Green: Microeconomic Theory, Oxford university press, 1995."},{"key":"2528_CR25","unstructured":"Ahuva Mu\u2019alem and Noam Nisan: Truthful approximation mechanisms for restricted combinatorial auctions, in: AAAI-02, 2002."},{"key":"2528_CR26","doi-asserted-by":"crossref","unstructured":"Noam Nisan: The communication complexity of approximate set packing and covering, in: ICALP, 2002.","DOI":"10.1007\/3-540-45465-9_74"},{"key":"2528_CR27","doi-asserted-by":"crossref","unstructured":"Noam Nisan: Introduction to Mechanism Design (for Computer Scientists), in: Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos and V. Vazirani, editors, 2007.","DOI":"10.1017\/CBO9780511800481"},{"key":"2528_CR28","unstructured":"Noam Nisan and Amir Ronen: Computationally feasible vcg-based mechanisms, in: EC\u201900."},{"key":"2528_CR29","doi-asserted-by":"crossref","unstructured":"Noam Nisan and Ilya Segal: The communication requirements of efficient allocations and supporting prices, in: Journal of Economic Theory, 2006.","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"2528_CR30","unstructured":"Kevin Roberts: The characterization of implementable choise rules, in: Jean-Jacques Laffont, editor, Aggregation and Revelation of Preferences. Papers presented at the first European Summer Workshop of the Economic Society, 321\u2013349. North-Holland, 1979."},{"key":"2528_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"2002","unstructured":"Tuomas Sandholm: Algorithm for optimal winner determination in combinatorial auctions, in: Artificial Intelligence 135 (2002), 1\u201354.","journal-title":"Artificial Intelligence"},{"key":"2528_CR32","volume-title":"Approximation algorithms","author":"V. V. Vazirani","year":"2001","unstructured":"Vijay V. Vazirani: Approximation algorithms, Springer-Verlag New York, Inc., New York, NY, USA, 2001."},{"key":"2528_CR33","doi-asserted-by":"crossref","unstructured":"W. Vickrey: Counterspeculation, auctions and competitive sealed tenders, Journal of Finance (1961), 8\u201337.","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2528-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-011-2528-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2528-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T17:03:16Z","timestamp":1560963796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-011-2528-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["2528"],"URL":"https:\/\/doi.org\/10.1007\/s00493-011-2528-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11]]}}}