Incentive

Common value auction

Vickrey auction

World Wide Web

Complete information

Microeconomics

Materials science

Aggregate (composite)

Economics

Computer science

Mathematical optimization

Payment

Auction theory

Mechanism design

Incentive compatibility

Mathematics

Composite material

Mathematical economics

Vickrey–Clarke–Groves auction

Profit (economics)

Econometrica

A profit‐maximizing seller has a single unit of a good to sell. The bidders have a pure common value that is drawn from a distribution that is commonly known. The seller does not know the bidders' beliefs about the value and thinks that beliefs are designed adversarially by Nature to minimize profit. We construct a strong maxmin solution to this joint mechanism design and information design problem, consisting of a mechanism, an information structure, and an equilibrium, such that neither the seller nor Nature can move profit in their respective preferred directions, even if the deviator can select the new equilibrium. The mechanism and information structure solve a family of maxmin mechanism design and minmax information design problems, regardless of how an equilibrium is selected. The maxmin mechanism takes the form of a proportional auction : each bidder submits a one‐dimensional bid, the aggregate allocation and aggregate payment depend on the aggregate bid, and individual allocations and payments are proportional to bids. We report a number of additional properties of the maxmin mechanisms, including what happens as the number of bidders grows large and robustness with respect to the prior over the value.

Optimal Auction Design With Common Values: An Informationally Robust Approach