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 August 1, 2017 | Submitted
Report Open

Reduced Form Auctions Revisited

Abstract

This note uses Farkas's Lemma to prove new results 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

Published as Border, K.C. (2007). Reduced form auctions revisited. Economic Theory, 31(1), 167-181.

Attached Files

Submitted - sswp1175.pdf

Files

sswp1175.pdf
Files (232.0 kB)
Name Size Download all
md5:9a68b7d89d9221304aee0b9d7c54730d
232.0 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
January 13, 2024