Published August 1, 2017
| Submitted
Report
Open
Reduced Form Auctions Revisited
- Creators
- Border, Kim C.
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
- Eprint ID
- 79645
- Resolver ID
- CaltechAUTHORS:20170731-164441362
- Created
-
2017-08-01Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Social Science Working Papers
- Series Name
- Social Science Working Paper
- Series Volume or Issue Number
- 1175