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

A firm can merge with one of n potential partners. The owner of each firm has private information about both his firm's stand-alone value and a component of the synergies that would be realized by the merger involving his firm. We characterize incentive-efficient mechanisms in two cases. First,...

We study whether the mechanism design in the central bank liquidity auctions matters for the interbank money market interest rate levels and volatility. Furthermore, we compare different mechanisms to sell liquidity in terms of revenue, efficiency and auction stage interest rate levels and...

A firm can merge with one of n potential partners. The owner of each firm has private information about both his firm’s stand-alone value and a component of the synergies that would be realized by the merger involving his firm. We characterize incentive-efficient mechanisms in two cases....

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

This paper examines the optimal mechanism design problem when buyers have uncertain valuations. This uncertainty can only be resolved after the actual transactions take place and upon incurring significant post-purchase cost. We focus on two different settings regarding how the seller values a...

This paper describes a nearly optimal auction mechanism that does not require previous knowledge of the distribution of values of potential buyers. The mechanism we propose builds on the new literature on the elicitation of information from experts. We extend the latter to the case where the...

We characterize the boundaries of the set of transfers (extremal transfers) implementing a given allocation rule without imposing any assumptions on the agentʼs type space or utility function besides quasi-linearity. Exploiting the concept of extremal transfers allows us to obtain an exact...

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