We examine a setting of independent private value auctions where bidders can covertly acquire gradual information about their valuations. We demonstrate that a dynamic pivot mechanism implements the rst-best information acquisition and allocation rule. We apply our results to a commonly used...

We examine a setting of independent private value auctions where bidders can covertly acquire gradual information about their valuations. We demonstrate that a dynamic pivot mechanism implements the rst-best information acquisition and allocation rule. We apply our results to a commonly used...

We study mediated many-to-many matching in markets in which valuations evolve over time as the result of shocks, learning through experimentation, or a preference for variety. The analysis uncovers the key tradeoffs that platforms face in the design of their matching protocols. It shows that the...

We study mediated many-to-many matching in markets in which valuations evolve over time as the result of shocks, learning through experimentation, or a preference for variety. The analysis uncovers the key tradeoffs that platforms face in the design of their matching protocols. It shows that the...

As a selling mechanism, auctions have acquired a central position in the free market economy all over the globe. This development has deepened, broadened, and expanded the theory of auctions in new directions. This chapter is intended as a selective update of some of the developments and...

We characterize the revenue-maximizing mechanism for time separable allocation problems in continuous time. The valuation of each agent is private information and changes over time. At the time of contracting every agent privately observes his initial type which influences the evolution of his...