{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:27:29Z","timestamp":1726410449122},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450457"},{"type":"electronic","value":"9783642450464"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-45046-4_17","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:53:01Z","timestamp":1386593581000},"page":"202-215","source":"Crossref","is-referenced-by-count":0,"title":["Truthfulness Flooded Domains and the Power of Verification for Mechanism Design"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[]},{"given":"Emmanouil","family":"Zampetakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Archer, A., Kleinberg, R.: Characterizing truthful mechanisms with convex type spaces. ACM SIGecom Exchanges\u00a07(3) (2008)","DOI":"10.1145\/1486877.1486882"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., Kleinberg, R.: Truthful germs are contagious: A local-to-global characterization of truthfulness. In: Proc. of the 9th ACM Conference on Electronic Commerce (EC 2008), pp. 21\u201330 (2008)","DOI":"10.1145\/1386790.1386796"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s10458-009-9119-4","volume":"22","author":"V. Auletta","year":"2011","unstructured":"Auletta, V., Penna, P., Persiano, G., Ventre, C.: Alternatives to truthfulness are hard to recognize. Autonomous Agents and Multi-Agent Systems\u00a022(1), 200\u2013216 (2011)","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.jcss.2008.10.001","volume":"75","author":"V. Auletta","year":"2009","unstructured":"Auletta, V., De Prisco, R., Penna, P., Persiano, G.: The power of verification for one-parameter agents. Journal of Computer and System Sciences\u00a075, 190\u2013211 (2009)","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-04645-2_4","volume-title":"Algorithmic Game Theory","author":"A. Berger","year":"2009","unstructured":"Berger, A., M\u00fcller, R., Naeemi, S.H.: Characterizing incentive compatibility for convex valuations. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol.\u00a05814, pp. 24\u201335. Springer, Heidelberg (2009); Updated version as Research Memoranda 035, Maastricht Research School of Economics of Technology and Organization"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Elkind, E., Szegedy, M., Yu, L.: Mechanism design: from partial to probabilistic verification. In: Proc. of the 13th ACM Conference on Electronic Commerce (EC 2012), pp. 266\u2013283 (2012)","DOI":"10.1145\/2229012.2229035"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"661","DOI":"10.3982\/ECTA9454","volume":"80","author":"G. Carroll","year":"2012","unstructured":"Carroll, G.: When are local incentive constraints sufficient? Econometrica\u00a080(2), 661\u2013686 (2012)","journal-title":"Econometrica"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2012.11.036","volume":"472","author":"D. Fotakis","year":"2013","unstructured":"Fotakis, D., Tzamos, C.: Winner-imposing strategyproof mechanisms for multiple Facility Location games. Theoretical Computer Science\u00a0472, 90\u2013103 (2013)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.2307\/2297639","volume":"53","author":"J. Green","year":"1986","unstructured":"Green, J., Laffont, J.: Partially verifiable information and mechanism design. Review of Economic Studies\u00a053(3), 447\u2013456 (1986)","journal-title":"Review of Economic Studies"},{"key":"17_CR10","unstructured":"Gui, H., M\u00fcller, R., Vohra, R.V.: Dominant strategy mechanisms with multi-dimensional types. Discussion Paper\u00a01392, Northwestern University (2004)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-15781-3_4","volume-title":"Algorithms \u2013 ESA 2010","author":"P. Krysta","year":"2010","unstructured":"Krysta, P., Ventre, C.: Combinatorial auctions with verification are tractable. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 39\u201350. Springer, Heidelberg (2010)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Introduction to Mechanism Design (for Computer Scientists). In: Algorithmic Game Theory, ch.\u00a09, pp. 209\u2013241 (2007)","DOI":"10.1017\/CBO9780511800481.011"},{"key":"17_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"},{"issue":"2","key":"17_CR14","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 necessary and sufficient condition for rationalizability in a quasi-linear context. Journal of Mathematical Economics\u00a016(2), 191\u2013200 (1987)","journal-title":"Journal of Mathematical Economics"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Saks, M.E., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: Proc. of the 6th ACM Conference on Electronic Commerce (EC 2005), pp. 286\u2013293 (2005)","DOI":"10.1145\/1064009.1064040"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.jet.2012.12.001","volume":"148","author":"S. Sato","year":"2013","unstructured":"Sato, S.: A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one. J.\u00a0Economic Theory\u00a0148, 259\u2013278 (2013)","journal-title":"J.\u00a0Economic Theory"},{"key":"17_CR17","unstructured":"Vohra, R.V.: Mechanism Design: A Linear Programming Approach. Cambridge University Press (2011)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45046-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T21:52:55Z","timestamp":1676843575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45046-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450457","9783642450464"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45046-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}
