The article explores whether it is possible to implement Nash equilibrium using mechanisms that are not affected by a minority of players deviating from their strategies. The researchers found that in a standard setting, it is impossible to implement any social choice rule with such mechanisms. However, if simple transfers are used and at least one player is honest, any social choice rule can be implemented using an outcome-robust mechanism. The mechanism introduced in the paper requires no assumptions about how transfers affect players' preferences, has no transfers in equilibrium, minimal off-equilibrium transfers, and avoids integer or modulo games.