Auction Design Without Commitment
42 Pages Posted: 17 Apr 2003
Date Written: March 2003
Abstract
We study auction design when parties cannot commit themselves to the mechanism. The seller may change the rules of the game and the buyers choose their outside option at all stages. We assume that the seller has a leading role in equilibrium selection at any stage of the game. Stationary equilibria are characterized in the language of vonNeumann-Morgenstern stable sets. This simplifies the analysis remarkably. In the one buyer case, we obtain the Coase conjecture: the buyer obtains all the surplus and efficiency is reached. However, in the multiple buyer case the seller can achieve more: she is able to commit to the English auction. Typically the converse also holds, the English auction is the only stable auction mechanism.
Keywords: Auction Theory, Commitment, Stable Sets
JEL Classification: C72, D44, D78
Suggested Citation: Suggested Citation
Do you have a job opening that you would like to promote on SSRN?
Recommended Papers
-
Private Information Revelation in Common-Value Auctions
By Vlad Mares and Ron Harstad
-
Sequential vs. Single-Round Uniform-Price Auctions
By Claudio Mezzetti, Saša Pekeč, ...
-
Information Aggregation in Auctions with an Unknown Number of Bidders
By Ron Harstad, Saša Pekeč, ...
-
A Lotting Method for Electronic Reverse Auctions
By U. Kaymak, J. P. Verkade, ...
-
Optimal Afforestation Contracts with Asymmetric Information on Private Environmental Benefits