Becoming the Neighbor Bidder: Endogenous Winner's Curse in Dynamic Mechanisms

This paper addresses the problem of sequentially allocating timesensitive goods, or one-period leases on a durable good, among agents who compete through time and learn about the common component of the value of the allocation through experience. I show that efficiency is unattainable, and I identify simple variations of sequential second-price or English auctions that implement the second best and the revenuemaximizing auction. When the units are divisible, I also identify the corresponding auctions that allow for double sourcing.