| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5071977 | Games and Economic Behavior | 2012 | 16 Pages |
Abstract
⺠We analyse Nash implementation when player(s) have a small preference for honesty. ⺠We show that almost all correspondences are Nash implementable with 3 or more agents. ⺠This can be proved in separable domains without using integer or modulo games. ⺠Characterization results and implications are proved for the two-person case.
Keywords
Related Topics
Social Sciences and Humanities
Economics, Econometrics and Finance
Economics and Econometrics
Authors
Bhaskar Dutta, Arunava Sen,