The theory of full implementation has been criticized for using integer/modulo games, which admit no equilibrium (Jackson (1992)). To address the critique, we revisit the classical Nash implementation problem due to Maskin (1977, 1999) but allow for the use of lotteries and monetary transfers as...

We study full implementation with evidence in an environment with bounded utilities. We show that a social choice function is Nash implementable in a direct revelation mechanism if and only if it satisfies the measurability condition proposed by Ben-Porath and Lipman (2012). Building on a novel...

We revisit the idea that robustness concerns can provide a foundation for simple mechanisms. Formally, we consider the robust implementation notion of continuous implementation (Oury and Tercieux, 2012), where continuity is with respect to players' hierarchy of beliefs. We define simplicity as...