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

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

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

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 characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders’ independent signals. If the object is optimally sold with probability one, then the optimal mechanism is simply a posted price, with the highest...

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 study how the outcomes of a private-value first price auction can vary with bidders' information, for a fixed distribution of private values. In a two bidder, two value, setting, we characterize all combinations of bidder surplus and revenue that can arise, and identify the information...

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