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

We consider an auction environment with interdependent values. Each bidder can learn her payoff type through costly information acquisition. We contrast the socially optimal decision to acquire information with the equilibrium solution in which each agent has to privately bear the cost of...

We consider a general mechanism design setting where each agent can acquire (covert) information before participating in the mechanism. The central question is whether a mechanism exists which provides the efficient incentives for information acquisition ex-ante and implements the efficient...

We characterize the revenue-maximizing information structure in the second price auction. The seller faces a classic economic trade-o¤: providing more information improves the efficiency of the allocation but also creates higher information rents for bidders. The information disclosure policy...

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