Informationally Robust Optimal Auction Design
37 Pages Posted: 16 Dec 2016
Date Written: December 16, 2016
A single unit of a good is to be sold by auction to one of two buyers. The good has either a high value or a low value, with known prior probabilities. The designer of the auction knows the prior over values but is uncertain about the correct model of the buyers’ beliefs. The designer evaluates a given auction design by the lowest expected revenue that would be generated across all models of buyers’ information that are consistent with the common prior and across all Bayesian equilibria. An optimal auction for such a seller is constructed, as is a worst-case model of buyers’ information. The theory generates upper bounds on the seller’s optimal payoff for general many-player and common-value models.
Keywords: optimal auctions, common values, information structure, model uncertainty, ambiguity aversion, robustness, Bayes correlated equilibrium, revenue maximization, revenue equivalence, information rent
JEL Classification: C72, D44, D82, D83
Suggested Citation: Suggested Citation