In an ideal continuous-price English auction, staying active until one's private valuation is optimal: dropping earlier can forgo positive surplus, while staying later risks paying more than the car is worth. The highest-valued buyer therefore wins, paying the price at which the other buyer drops out, namely .
For , independence gives . Integrating this tail probability gives
“Pays his bid” in this ascending auction does not mean that the winning buyer pays his full valuation; the competing buyer's dropout determines the winning price.
With reserve price , an English auction makes no sale if both valuations are below . If exactly one exceeds it, the price is ; if both exceed it, the price is their minimum. Thus
The first term accounts for one qualifying buyer, and the integral uses the density of the smaller valuation. Differentiation gives . It increases up to and decreases afterwards, while the endpoints give and zero. Therefore
The strict sale condition at the reserve changes only a probability-zero event.
Reserve price 2026-10-14
A reserve price is the seller's minimum acceptable price. In an English auction it changes both the sale rule and the payment rule: the highest valuation must exceed the reserve and the winner pays at least the reserve. Mechanisms with different reserves generally have different allocation probabilities, so revenue equivalence need not equate their expected revenues.
For two independent uniform valuations on , optimal posted price revenue is , attained at . An English auction without reserve earns the expected minimum, . With reserve , revenue is plus the expected smaller valuation when both exceed , namely . It is maximized at , giving . Different reserve-dependent allocation probabilities explain why this differs from the no-reserve revenue without violating revenue equivalence.