On nash implementation of social choice correspondences

Abstract In this paper, we extend Danilov's conditions for Nash implementation to weak preferences over an arbitrary set of alternatives. We show that a certain condition of “strong monotonicity” is necessary for Nash implementation if the domain of preferences is sufficiently large. Furthermore, in any preference domain of weak orders, it is also sufficient for Nash implementation if there are at least three agents.