Nash implementation with partially honest individuals

► 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.