Reduced form auctions revisited

This note uses the Theorem of the Alternative to prove newresults on the implementability of general, asymmetric auctions, and to provide simpler proofs of known results for symmetric auctions. The tradeoff is that type spaces are taken to be finite.