We provide a new characterization of implementability of reduced form mechanisms in terms of straightforward second-order stochastic dominance. In addition, we present a simple proof of Matthews' (1984) conjecture, proved by Border (1991), on implementability