Implementation Via Nash Equilibria
This paper is concerned with a problem of implementation of a given social choice correspondence. The authors introduces an essential monotonicity condition and show that any implementable social choice correspondence satisfies this condition. Conversely, in a case of three or more participants, any essentially monotone social choice correspondence is implementable. In a case of two participants, the essential monotonicity condition must be completed by a requirement that the social choice correspondence is close to an individually rational correspondence.