Multiple-unit English auctions

This paper examines the outcome of an ascending-price multiple-unit auction. Two bidders, facing continuous, downward-sloping demand functions, participate in the auction of some divisible objects. The auctioneer starts the process by announcing an initial price and asking both bidders to submit sealed-bids of desired quantities. The auctioneer increases the price until the total amount bid for is less than the total supply. We compute the outcome of this auction game under full information and suggest that this mechanism may not maximize expected revenue. Copyright © 1996 Published by Elsevier Science B.V