Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We design a multi‐unit descending‐price (Dutch) auction mechanism that has applications for resource allocation and pricing problems. We address specific auction design choices by theoretically and experimentally determining optimal information disclosure along two dimensions. Bidders are either informed of the number of bidders in the auction, or know that it is one of two possible sizes; they also either know the number of units remaining for sale or are unaware of how many units have been taken by other bidders. We find that revealing group size decreases bids, and therefore revenue, if units remaining are not shown. When group size is unknown the price also falls if the number of units remaining is revealed. The most efficient and largest revenue outcome occurs when bidders are not provided information on either group size or units remaining. These laboratory results conform to some directional predictions from our theory, although overbidding is common.