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

This paper provides a unified approach to equilibrium analysis in models for competing mechanisms (e.g., Szentes (2009), Yamashita (2010)), which may differ in terms of delegation of action choice, announcement of mechanisms, observability of messages, and equilibrium notions

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

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