Academic Commons


Simple Mechanisms and Preferences for Honesty

Holden, Richard; Kartik, Navin; Tercieux, Olivier

We consider full implementation in abstract complete-information environments when agents have an arbitrarily small preference for honesty. We offer a condition called separable punishment and show that when it holds and there are at least two agents, any social choice function can be implemented by a simple mechanism in two rounds of iterated deletion of strictly dominated strategies. We also extend our result to settings of incomplete information so long as there is non-exclusive information.



More About This Work

Academic Units
Department of Economics, Columbia University
Department of Economics Discussion Papers, 1213-06
Published Here
November 7, 2012
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.