Virtual Implementation in Separable Bayesian Environments Using Simple Mechanisms

This paper studies virtual implementation in Bayesian environments and identifies separability conditions under which social choice functions can be implemented via the iterative removal of strictly dominated strategies by simple mechanisms. Our mechanisms are simple in that (1) implementation is achieved in two rounds of iteratively removing strictly dominated strategies and (2) they employ a message space that is small and invariant to the closeness of the approximation.