We consider truthful implementation of the socially efficient allocation in an independent private-value environment in which agents receive private information over time. We propose a suitable generalization of the pivot mechanism, based on the marginal contribution of each agent. In the...

This paper analyzes the optimal provision of incentives in a sequential testing context. In every period the agent can acquire costly information that is relevant to the principal's decision. Neither the agent's effort nor the realizations of his signals are observable. First, we assume that the...

We provide an introduction to the recent developments in dynamic mechanism design, with a primary focus on the quasilinear case. First, we describe socially optimal (or efficient) dynamic mechanisms. These mechanisms extend the well-known Vickrey-Clark-Groves and D'Aspremont-Gérard-Varet...

A single unit of a good is to be sold by auction to one of two buyers. The good has either a high value or a low value, with known prior probabilities. The designer of the auction knows the prior over values but is uncertain about the correct model of the buyers' beliefs. The designer evaluates...

We study auction design when bidders have a pure common value equal to the maximum of their independent signals. In the revenue maximizing mechanism, each bidder makes a payment that is independent of his signal and the allocation discriminates in favor of bidders with lower signals. We provide...

We explore the impact of private information in sealed bid first price auctions. For a given symmetric and arbitrarily correlated prior distribution over values, we characterize the lowest winning bid distribution that can arise across all information structures and equilibria. The information...

A data buyer faces a decision problem under uncertainty. He can augment his initial private information with supplemental data from a data seller. His willingness to pay for supplemental data is determined by the quality of his initial private information. The data seller optimally offers a menu...

We propose a sequential auction mechanism for a single object in which the seller jointly determines the allocation and the disclosure policy. A sequential disclosure rule is shown to implement an ascending price auction in which each losing bidder learns his true valuation, but the winning...

We explore the impact of private information in sealed-bid first-price auctions. For a given symmetric and arbitrarily correlated prior distribution over values, we characterize the lowest winning-bid distribution that can arise across all information structures and equilibria. The information...

We investigate the role of market transparency in repeated first-price auctions. We consider a setting with independent private and persistent values. We analyze three distinct disclosure regimes regarding the bid and award history. In the minimal disclosure regime each bidder only learns...