Reduced Form Auctions Revisited

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.

MoreLess

Year of publication:	2003-09
Authors:	Border, Kim C.
Institutions:	California Institute of Technology, Division of the Humanities and Social Sciences
Subject:	asymmetric auction \| reduced form auction \| Farkas Lemma

More details

Extent:	application/pdf
Series:	Working Papers.
Type of publication:	Book / Working Paper
Notes:	Published: Number 1175 19 pages
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005482081