  We study Nash implementation by stochastic mechanisms, and provide a
surprisingly simple full characterization, which is in sharp contrast to the
classical, albeit complicated, full characterization in Moore and Repullo
(1990).
