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

We offer a definition of iterated elimination of strictly dominated strategies (IESDS) for games with (in)finite players, (non)compact strategy sets, and (dis)continuous payoff functions. IESDS is always a well-defined order independent procedure that can be used to solve Nash equilibrium in...