| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5071906 | Games and Economic Behavior | 2014 | 7 Pages |
Abstract
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.
Related Topics
Social Sciences and Humanities
Economics, Econometrics and Finance
Economics and Econometrics
Authors
Navin Kartik, Olivier Tercieux, Richard Holden,