Immediate demand reduction in simultaneous ascending bid auctions

The present note analyzes the Simultaneous Ascending Bid Auction with arbitrarily many bidders with decreasing marginal valuations under complete information. We show that the game is solvable by iterated elimination of weakly dominated strategies if the efficient allocation assigns at least one unit to every player and if bid increments are sufficiently small. In that unique equilibrium, bidders immediately reduce their demand to the efficient allocation, and the auction ends in the first round of bidding.