The two-person case needs to be considered separately. We provide a complete characterization of virtually implementable two-person social choice functions. While not all two-person social choice functions are virtually implementable, our necessary and sufficient condition is simple. This contrasts with the rather complex necessary and sufficient conditions for exact implementation. We show how our results can be extended to implementation in strict Nash equilibrium and coalition-proof Nash equilibrium, to social choice correspondences which map from cardinal preference profiles to lotteries, and to environments with a continuum of pure alternatives.