Simple mechanisms and preferences for honesty

Journal article: We consider full implementation in 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.

Author(s)

Navin Kartik, Olivier Tercieux, Richard Holden

Journal
  • Games and Economic Behavior
Date of publication
  • 2014
Keywords JEL
C72 D02 D71 D82
Keywords
  • Behavioral mechanism design
  • Implementation
  • Lying costs
  • Separable domain
Pages
  • 284-290
Version
  • 1
Volume
  • 83