We propose an incomplete information analogue of rationalizability. An action is said to be belief-free rationalizable if it survives the following iterated deletion process. At each stage, we delete actions for a type of a player that are not a best response to some conjecture that puts weight...

We analyze the welfare consequences of a monopolist having additional information about consumers' tastes, beyond the prior distribution; the additional information can be used to charge different prices to different segments of the market, i.e., carry out "third degree price discrimination."We...

We analyze the welfare consequences of a monopolist having additional information about consumers' tastes, beyond the prior distribution; the additional information can be used to charge different prices to different segments of the market, i.e., carry out "third degree price discrimination."We...

We analyze the welfare consequences of a monopolist having additional information about consumers tastes, beyond the prior distribution; the additional information can be used to charge different prices to different segments of the market, i.e., carry out "third degree price discrimination". We...

We analyze the welfare consequences of a monopolist having additional information about consumers' tastes, beyond the prior distribution; the additional information can be used to charge different prices to different segments of the market, i.e., carry out "third degree price discrimination."We...

We analyze the welfare consequences of a monopolist having additional information about consumers' tastes, beyond the prior distribution; the additional information can be used to charge different prices to different segments of the market, i.e., carry out "third degree price discrimination." We...

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 survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents whose private information remains fixed throughout time; and those with a fixed population of agents whose private information changes...

A seller wishes to sell an object to one of multiple bidders. The valuations of the bidders are privately known. We consider the joint design problem in which the seller can decide the accuracy by which bidders learn their valuation and to whom to sell at what price. We establish that optimal...

We survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents or buyers whose private information remains fixed throughout time; and those with a fixed population of agents or buyers whose private...