Abstract
This note uses the Theorem of the Alternative 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Border K.C. (1991) Implementation of reduced form auctions: a geometric approach. Econometrica 59(4): 1175–1187
Franklin, J.: Methods of mathematical economics: linear and nonlinear programming, fixed point theorems. Number 37. In: Classics in applied mathematics. Philadelphia: SIAM 2002. Corrected reprint of the 1980 edition published by Springer, Berlin Heidelberg New York
Maskin E.S., Riley J. (1984) Optimal auctions with risk averse buyers. Econometrica 52, 1473–1518
Matthews S.A. (1984) On the implementability of reduced form auctions. Econometrica 52, 1519–22
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Border, K.C. Reduced Form Auctions Revisited. Economic Theory 31, 167–181 (2007). https://doi.org/10.1007/s00199-006-0080-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00199-006-0080-z