Simple mechanisms and preferences for honesty
Article dans une revue: 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.
Auteur(s)
Navin Kartik, Olivier Tercieux, Richard Holden
Revue
- Games and Economic Behavior
Date de publication
- 2014
Mots-clés JEL
Mots-clés
- Behavioral mechanism design
- Implementation
- Lying costs
- Separable domain
Pages
- 284-290
URL de la notice HAL
Version
- 1
Volume
- 83