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

This note studies the problem of implementing social choice correspondences in environments where individuals have doubts about the rationality of their opponents. We postulate the concept of "-minimax regret as our solution concept and show that social choice correspondences that are Maskin...

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

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>