Simple Mechanisms and Preferences for Honesty

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