I consider optimal auctions for a seller who is bound to sell a single item to one of two potential buyers, organized in a `well-coordinated' cartel. I show that, even though the seller cannot deter collusion, he can optimally accommodate it by employing a simple mechanism which imposes an...

A crucial assumption in the optimal auction literature is that each bidder's valuation is known to be drawn from a unique distribution. In this paper we study the optimal auction problem allowing for ambiguity about the distribution of valuations. Agents may be ambiguity averse (modeled using...

This paper revisits the licensing of a non–drastic process innovation by an outside innovator to a Cournot oligopoly. We propose a new mechanism that combines a restrictive license auction with royalty licensing. This mechanism is more profitable than standard license auctions, auctioning...

This paper examines whether the seller of an object should reveal the identities of the participating bidders before bids become due. It is shown that when bidders experience identity dependent externalities and auction participation is exogenous, then for a large class of standard auction...

A competitive economy is studied in which sellers offer alternative direct mechanisms to buyers who have private information about their own private use value for the commodity being traded. In addition the commodity has a common value to all buyers, perhaps represented by the future resale...

This paper studies the optimal auction for a seller who is bound to sell a single item to one of two potential buyers organized in a ”well-coordinated” cartel. After discussing the way the cartel reacts to any auction mechanism, we show that if the seller has no way to deter collusion, he...

This paper revisits the standard analysis of licensing a cost reducing innovation by an outside innovator to a Cournot oligopoly. We propose a new mechanism that combines elements of a license auction with royalty licensing by granting the losers of the auction the option to sign a royalty...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...

We study the allocation of several heterogenous, commonly ranked objects to impatient agents with privately known characteristics who arrive sequentially according to a Poisson or renewal process. We analyze and compare the policies that maximize either welfare or revenue. We focus on two cases:...