Virtual Nash implementation with admissible support

A social choice correspondence (SCC) is virtually implementable if it is ε-close (in the probability simplex) to some (exactly) implementable correspondence. Abreu and Sen (1991) proved that, without restriction on the set of alternatives receiving strictly positive probability at equilibrium, every SCC is virtually implementable in Nash Equilibrium. We study virtual implementation when the supports of equilibrium lotteries are restricted. We provide a necessary and sufficient condition, imposing joint restrictions on SCCs and admissible supports. Then, we discuss how to construct supports. Finally, we study virtual implementation when the support is restricted to the efficient or individually rational alternatives.