This paper studies full implementation problems in (pure and mixed) Nash equilibrium in finite environments. We restrict the designer to adopt<I>finite</I> mechanisms, thus ruling out integer games. We provide a condition, top-<I>D</I> inclusiveness, that together with set-monotonicity is sufficient for mixed...</i></i>

This paper studies repeated implementation of social choice functions in environments with complete information and changing preferences. We introduce the condition of dynamic monotonicity and show that it is necessary for repeated implementation in finite as well as infinite horizon problems....

A mechanism implements a social choice correspondence f in mixed Nash equilibrium if at any preference profile, the set of all pure and mixed Nash equilibrium outcomes coincides with the set of f-optimal alternatives at that preference profile. This definition generalizes Maskin's definition of...

A mechanism implements a social choice correspondence f in mixed Nash equilibrium if at any preference profile, the set of all pure and mixed Nash equilibrium outcomes coincides with the set of f-optimal alternatives at that preference profile. This definition generalizes Maskin's definition of...