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 consider the implementation of social choice functions under complete information in rationalizable strategies. A strict (and thus stronger) version of the monotonicity condition introduced by Maskin (1999) is necessary under the solution concept of rationalizability. Assuming the social...

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 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...

We analyze the canonical nonlinear pricing model with limited information. A seller offers a menu with a finite number of choices to a continuum of buyers with a continuum of possible valuations. By revealing an underlying connection to quantization theory, we derive the optimal finite menu for...

This essay is the introduction for a collection of papers by the two of us on "Robust Mechanism Design" to be published by World Scientific Publishing. The appendix of this essay lists the chapters of the book.The objective of this introductory essay is to provide the reader with an overview of...

The Introduction to the Symposium Issue on “Dynamic Contract and Mechanism Design” of the Journal of Economic Theory provides an overview of the dynamic mechanism design literature. We then introduce the papers that are contained in the Symposium issue and finally conclude by discussing...

In mechanism design with (partially) verifiable information, the revelation principle obtains in full generality if allocations are modelled as the product set of outcomes and verifiable information. Incentive constraints fully characterize the implementable set of these product-allocations. The...

This paper analyzes the trade of information between a data buyer and a data seller. The data buyer faces a decision problem under uncertainty and seeks to augment his initial private information with supplemental data. The data seller is uncertain about the willingness-to-pay of the data buyer...

We provide an introduction into the recent developments of 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...