{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:28:15Z","timestamp":1725474495435},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_5","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T13:41:09Z","timestamp":1164634869000},"page":"37-49","source":"Crossref","is-referenced-by-count":6,"title":["Mechanisms with Verification for Any Finite Domain"],"prefix":"10.1007","author":[{"given":"Carmine","family":"Ventre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-31856-9_6","volume-title":"STACS 2005","author":"N. Andelman","year":"2005","unstructured":"Andelman, N., Azar, Y., Sorani, M.: Truthful approximation mechanisms for scheduling selfish related machines. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 69\u201382. Springer, Heidelberg (2005)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proc. of FOCS (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-540-24749-4_53","volume-title":"STACS 2004","author":"V. Auletta","year":"2004","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G.: Deterministic truthful approximation mechanisms for scheduling related machines. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 608\u2013619. Springer, Heidelberg (2004)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"5_CR5","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.\u00a04051, pp. 596\u2013607. Springer, Heidelberg (2006)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bikhchandani, S., Chatterji, S., Lavi, R., Mualem, A., Nisan, N., Sen, A.: Weak monotonicity characterizes deterministic dominant-strategy implementation. Econometrica (to appear, 2006)","DOI":"10.1111\/j.1468-0262.2006.00695.x"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: On the existence of truthful mechanisms for the minimum-cost approximated shortest-paths tree problem. Technical report (2006)","DOI":"10.1007\/11780823_23"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanims design. In: Proc. of STOC (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17\u201333 (1971)","DOI":"10.1007\/BF01726210"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders. In: Proc. of STOC (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/11671411_12","volume-title":"Approximation and Online Algorithms","author":"A. Ferrante","year":"2006","unstructured":"Ferrante, A., Parlato, G., Sorrentino, F., Ventre, C.: Improvements for truthful mechanisms with verifiable one-parameter selfish agents. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 147\u2013160. Springer, Heidelberg (2006)"},{"key":"5_CR12","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":"5_CR13","unstructured":"Gui, H., M\u00fcller, R., Vohra, R.V.: Dominant strategy mechanisms with multidimensional types. Technical report (2004)"},{"key":"5_CR14","unstructured":"Lavi, R., Mu\u2019Alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions. In: Proc. of FOCS (2003)"},{"issue":"5","key":"5_CR15","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D. Lehmann","year":"2002","unstructured":"Lehmann, D., O\u2019Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. Journal of the ACM\u00a049(5), 577\u2013602 (2002)","journal-title":"Journal of the ACM"},{"key":"5_CR16","unstructured":"Malakhov, A., Vohra, R.V.: Single and multi-dimensional optimal auctions - a network approach. Technical report (2004)"},{"key":"5_CR17","unstructured":"Mu\u2019Alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. In: Proc. of AAAI (2002)"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R. Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Mathematics of Operations Research\u00a06, 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic Mechanism Design. In: Proc. of STOC (1999)","DOI":"10.1145\/301250.301287"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Computationally feasible VCG mechanisms. In: Proc. of EC (2000)","DOI":"10.1145\/352871.352898"},{"key":"5_CR21","unstructured":"Roberts, K.: The Characterization of Implementable Choice Rule. In: Laffont, J.J. (ed.) Aggregation and Revelation of Preferences (1979)"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-4068(87)90007-3","volume":"16","author":"J.-C. Rochet","year":"1987","unstructured":"Rochet, J.-C.: A condition for rationalizability in a quasi-linear context. Journal of Mathematical Economics\u00a016, 191\u2013200 (1987)","journal-title":"Journal of Mathematical Economics"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Saks, M., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: Proc. of EC (2005)","DOI":"10.1145\/1064009.1064040"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Ventre, C.: Mechanisms with verification for any finite domain. Technical report (2006)","DOI":"10.1007\/11944874_5"},{"key":"5_CR25","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","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:09:16Z","timestamp":1558271356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11944874_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}