Abstract
Direct generalization of Milgrom and Weber (1982) to the multiple-unit, multiple bid case appears to be technically intractable. Heretofore, the theoretical study of multiple bid auctions has followed Wilson (1979), in which each bidder is assumed to submit a continuous demand schedule. Although elegant, Wilson's model remains poorly understood. It has been solved only for a small number of special distributional assumptions, and appears to give rise to multiple equilibria. Furthermore, bidders in the real world typically submit only a small number of bids, so assuming continuity may be as unrealistic as assuming a single bid per bidder. In the Portuguese sample, for example, the median number of bids per bidder is three.
This paper takes a discrete approach. I model a simultaneous common
value auction of two identical units to n bidders. Private signals
of the good's value are assumed to be drawn from a finite set and bids
are restricted to finite intervals. Each bidder submits two bids, and
the two units are awarded to the two highest bids, whether from a
single or two distinct bidders. This discrete framework makes a
difficult problem numerically feasible, as the set of possible
strategies is finite. Under discriminatory pricing, the model shows
that the gap between a bidder's two bid prices increases with the
degree of risk aversion of the bidder and decreases with the precision
of public information on the value of the items.