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 consider the design of an optimal auction in which the seller can determine the allocation and the disclosure rule of the mechanism. Thus, in contrast to the standard analysis of a optimal auctions, the seller can explicitly design the disclosure of the information received by each bidder as...

A social choice function is robustly implemented if every equilibrium on every type space achieves outcomes consistent with it. We identify a robust monotonicity condition that is necessary and (with mild extra assumptions) sufficient for robust implementation. Robust monotonicity is strictly...

A social choice function is robustly implementable if there is a mechanism under which the process of iteratively eliminating strictly dominated messages leads to outcomes that agree with the social choice at every type profile. In an interdependent value environment with single crossing...

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

A social choice function is robustly implemented if every equilibrium on every type space achieves outcomes consistent with it. We identify a robust monotonicity condition that is necessary and (with mild extra assumptions) sufficient for robust implementation. Robust monotonicity is strictly...