We analyze a setting common in privatizations, public tenders, and takeovers in which the ex post efficient allocation, i.e., the first best, is not implementable. Our first main result is that the open ascending auction is not second best because it is prone to rushes, i.e., all active bidders...

In this paper, we examine the optimal mechanism design of selling an indivisible object to one regular buyer and one publicly known buyer, where inter-buyer resale cannot be prohibited. The resale market is modeled as a stochastic ultimatum bargaining game between the two buyers. We fully...

This paper studies the optimal mechanisms for a seller with imperfect commitment who puts up for sale one individual unit per period to a single buyer in a dynamic game. The buyer's willingness to pay remains constant over time and is his private information. In this setting, the seller cannot...

This paper shows that the possibility of collusion between an agent and a supervisor imposes no restrictions on the set of implementable social choice functions (SCF) and associated payoff vectors. Any SCF and any payoff profile that are implementable if the supervisor's information was public...