{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:42:40Z","timestamp":1743082960981,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_59","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"708-719","source":"Crossref","is-referenced-by-count":5,"title":["Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Penna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proc. of FOCS, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"59_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-540-27836-8_17","volume-title":"Automata, Languages and Programming","author":"V. Auletta","year":"2004","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G.: The power of verification for one-parameter agents. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 171\u2013182. Springer, Heidelberg (2004)"},{"key":"59_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/11786986_52","volume-title":"Automata, Languages and Programming","author":"V. Auletta","year":"2006","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G., Ventre, C.: New constructions of mechanisms with verification. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 596\u2013607. Springer, Heidelberg (2006)"},{"key":"59_CR4","unstructured":"Christodoulou, G., Koutsoupias, E., Vidali, A.: A lower bound for scheduling mechanisms. In: Proc. of SODA, pp. 1163\u20131170 (2007)"},{"key":"59_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17\u201333 (1971)","DOI":"10.1007\/BF01726210"},{"key":"59_CR6","unstructured":"Elkind, E., Sahai, A., Steiglitz, K.: Frugality in path auctions. In: Proc. of SODA, pp. 701\u2013709 (2004)"},{"issue":"1","key":"59_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00446-005-0122-y","volume":"18","author":"J. Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Papadimitriou, C.H., Sami, R., Shenker, S.: A bgp-based mechanism for lowest-cost routing. Distributed Computing\u00a018(1), 61\u201372 (2005)","journal-title":"Distributed Computing"},{"key":"59_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-77918-6_2","volume-title":"Approximation and Online Algorithms","author":"I. Gamzu","year":"2008","unstructured":"Gamzu, I.: Improved lower bounds for non-utilitarian truthfulness. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol.\u00a04927, pp. 15\u201326. Springer, Heidelberg (2008)"},{"key":"59_CR9","unstructured":"Goldberg, A.V., Hartline, J.D.: Collusion-resistant mechanisms for single-parameter agents. In: Proc. of SODA, pp. 620\u2013629 (2005)"},{"key":"59_CR10","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentive in Teams. Econometrica\u00a041, 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"59_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-540-74456-6_41","volume-title":"Mathematical Foundations of Computer Science 2007","author":"E. Koutsoupias","year":"2007","unstructured":"Koutsoupias, E., Vidali, A.: A lower bound of 1\u2009+\u2009\u03c6 for truthful scheduling mechanisms. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 454\u2013464. Springer, Heidelberg (2007)"},{"key":"59_CR12","unstructured":"Mu\u2019alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: Proc. of SODA, pp. 1143\u20131152 (2007)"},{"key":"59_CR13","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":"59_CR14","doi-asserted-by":"crossref","unstructured":"Nisan, N., Segal, I.: The communication requirements of efficient allocations and supporting prices. Journal of Economic Theory (2006)","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Computationally Feasible VCG Mechanisms. In: Proc. of EC, pp. 242\u2013252 (2000)","DOI":"10.1145\/352871.352898"},{"key":"59_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proc. of STOC (2001)","DOI":"10.1145\/380752.380883"},{"key":"59_CR17","doi-asserted-by":"crossref","unstructured":"Penna, P., Ventre, C.: Collusion-resistant mechanisms with verification yielding optimal solutions. Technical report (2008), \n                      http:\/\/www.dia.unisa.it\/~penna\/papers\/esa08full.pdf","DOI":"10.1145\/1566374.1566396"},{"key":"59_CR18","doi-asserted-by":"crossref","unstructured":"Penna, P., Ventre, C.: Optimal collusion-resistant mechanisms with verification. Technical Report (2008)","DOI":"10.1145\/1566374.1566396"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"Proietti, G., Widmayer, P.: A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. In: Proc. of SPAA, pp. 195\u2013202 (2005)","DOI":"10.1145\/1073970.1073999"},{"key":"59_CR20","unstructured":"Roberts, K.: The characterization of implementable choice rules. Aggregation and Revelation of Preferences, 321\u2013348 (1979)"},{"issue":"3","key":"59_CR21","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jeth.1999.2618","volume":"91","author":"J. Schummer","year":"2000","unstructured":"Schummer, J.: Manipulation through bribes. Journal of Economic Theory\u00a091(3), 180\u2013198 (2000)","journal-title":"Journal of Economic Theory"},{"key":"59_CR22","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":"59_CR23","doi-asserted-by":"crossref","unstructured":"Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8\u201337 (1961)","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:19:52Z","timestamp":1715059192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}