Virtual repeated implementation

We show that in the context of repeated implementation, any social choice rule which realizes all alternatives for a positive (yet arbitrarily small) amount of time is Nash implementable. The results complement those of the virtual implementation literature.