Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 2007 | public
Journal Article

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.

Additional Information

© Springer-Verlag 2006. Received: 17 September 2003 / Accepted: 4 January 2006 / Published online: 1 February 2006. Formerly SSWP 1175.

Additional details

August 19, 2023
October 17, 2023