Published 2007
| public
Journal Article
Reduced form auctions revisited
- Creators
-
Border, Kim C.
Chicago
Abstract
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
- Eprint ID
- 82962
- Resolver ID
- CaltechAUTHORS:20171103-155759339
- Created
-
2017-11-06Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field