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 payoﬀ for general many-player and common-value models.
Bergemann, Dirk; Brooks, Benjamin; and Morris, Stephen, "Informationally Robust Optimal Auction Design" (2016). Cowles Foundation Discussion Papers. 2528.