{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:27Z","timestamp":1725563547026},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157806"},{"type":"electronic","value":"9783642157813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15781-3_4","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T11:40:03Z","timestamp":1283341203000},"page":"39-50","source":"Crossref","is-referenced-by-count":4,"title":["Combinatorial Auctions with Verification Are Tractable"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Krysta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Papadimitriou, C.H., Talwar, K., Tardos, \u00c9.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: Proc. of SODA (2003)","DOI":"10.1080\/15427951.2004.10129086"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible multi unit combinatorial auctions. In: The Proc. of the 9th TARK, pp. 72\u201387 (2003)","DOI":"10.1145\/846241.846250"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1137\/050641181","volume":"39","author":"L. Blumrosen","year":"2009","unstructured":"Blumrosen, L., Nisan, N.: On the computational power of demand queries. SIAM J. Comput.\u00a039(4), 1372\u20131391 (2009)","journal-title":"SIAM J. Comput."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: Proc. of STOC, pp. 39\u201348 (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-69311-6_15","volume-title":"Frontiers in Algorithmics","author":"T. Bu","year":"2008","unstructured":"Bu, T., Deng, X., Qi, Q.: Multi-bidding strategy in sponsored keyword auction. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol.\u00a05059, pp. 124\u2013134. Springer, Heidelberg (2008)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Buchfuhrer, D., Dughmi, S., Fu, H., Kleinberg, R., Mossel, E., Papadimitriou, C.H., Schapira, M., Singer, Y., Umans, C.: Inapproximability for vcg-based combinatorial auctions. In: The Proc. of SODA (2010)","DOI":"10.1137\/1.9781611973075.45"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-74208-1_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Dobzinski","year":"2007","unstructured":"Dobzinski, S.: Two randomized mechanisms for combinatorial auctions. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 89\u2013103. Springer, Heidelberg (2007)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.geb.2005.05.005","volume":"56","author":"C. Gorkem","year":"2006","unstructured":"Gorkem, C.: Mechanism design with weaker incentive compatibility constraints. Games and Economic Behavior\u00a056(1), 37\u201344 (2006)","journal-title":"Games and Economic Behavior"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.2307\/2297639","volume":"53","author":"J.R. Green","year":"1986","unstructured":"Green, J.R., Laffont, J.: Partially Verifiable Information and Mechanism Design. The Review of Economic Studies\u00a053, 447\u2013456 (1986)","journal-title":"The Review of Economic Studies"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E. Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Computational Complexity\u00a015(1), 20\u201339 (2006)","journal-title":"Computational Complexity"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/S0899-8256(03)00184-2","volume":"47","author":"R. Holzman","year":"2004","unstructured":"Holzman, R., Kfir-Dahav, N., Monderer, D., Tennenholtz, M.: Bundling equilibrium in combinatorial auctions. Games and Economic Behavior\u00a047, 104\u2013123 (2004)","journal-title":"Games and Economic Behavior"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/11549345_53","volume-title":"Mathematical Foundations of Computer Science 2005","author":"P. Krysta","year":"2005","unstructured":"Krysta, P.: Greedy approximation via duality for packing, combinatorial auctions and routing. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 615\u2013627. Springer, Heidelberg (2005)"},{"issue":"5","key":"4_CR13","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D.J. Lehmann","year":"2002","unstructured":"Lehmann, D.J., O\u2019Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM\u00a049(5), 577\u2013602 (2002)","journal-title":"J. ACM"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/3-540-45465-9_74","volume-title":"Automata, Languages and Programming","author":"N. Nisan","year":"2002","unstructured":"Nisan, N.: The communication complexity of approximate set packing and covering. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 868\u2013875. Springer, Heidelberg (2002)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Computationally feasible vcg mechanisms. In: Proc. of EC (2000)","DOI":"10.1145\/352871.352898"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. Games and Economic Behavior\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.: Algorithmic Game Theory (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1007\/978-3-540-87744-8_59","volume-title":"Algorithms - ESA 2008","author":"P. Penna","year":"2008","unstructured":"Penna, P., Ventre, C.: Collusion-resistant mechanisms with verification yielding optimal solutions. In: Halperin, D., Mehlhorn, K. (eds.) Esa 2008. LNCS, vol.\u00a05193, pp. 708\u2013719. Springer, Heidelberg (2008)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Penna, P., Ventre, C.: Optimal collusion-resistant mechanisms with verification. In: Proc. of EC, pp. 147\u2013156 (2009)","DOI":"10.1145\/1566374.1566396"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11944874_5","volume-title":"Internet and Network Economics","author":"C. Ventre","year":"2006","unstructured":"Ventre, C.: Mechanisms with verification for any finite domain. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 37\u201349. Springer, Heidelberg (2006)"},{"key":"4_CR21","unstructured":"Vohra, R.V.: Paths, cycles and mechanism design. Technical report, Kellogg School of Management (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15781-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T22:28:30Z","timestamp":1559514510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15781-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157806","9783642157813"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15781-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}