Why do some incomplete information markets feature intermediaries while others do not? I study the allocation of two goods in an incomplete information setting with a single principal, multiple agents with unit demand, and interdependent valuations. I construct a novel dynamic mechanism...

In mechanism design, Myerson regularity is often too weak for a quantitative analysis of performance. For instance, ratios between revenue and welfare, or sales probabilities may vanish at the boundary of Myerson regularity. This paper therefore explores the quantitative version of Myerson...

McAfee and Reny (1992) have given a necessary and sufficient condition for full surplus extraction in naive type spaces with a continuum of payoff types. We generalize their characterization to arbitrary abstract type spaces and to the universal type space and show that in each setting, full...

McAfee and Reny (1992) have given a necessary and sufficient condition for full surplus extraction in models with a continuum of types. We interpret their condition as significantly stronger version of the requirement of injectiveness of the function mapping abstract types into beliefs and prove...

We consider a budget-constrained mechanism designer who selects an optimal set of projects to maximize her utility. Projects may differ in their value for the designer, and their cost is private information. In this allocation problem, the quantity of procured projects is endogenously determined...

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

I study a mechanism design problem of allocating a single good to an agent when the mechanism is followed by a post-mechanism game (aftermarket) played between the agent and a third-party. The aftermarket is beyond the direct control of the designer. However, she can influence the information...

Bidding in first-price auctions crucially depends on the beliefs of the bidders about their competitors' willingness to pay. We analyze bidding behavior in a first-price auction in which the knowledge of the bidders about the distribution of their competitors' valuations is restricted to the...

We consider a budget-constrained mechanism designer who selects an optimal set of projects to maximize her utility. A project's cost is private information and its value for the designer may vary. In this allocation problem, the selection of projects - both which and how many - is endogenously...

In auction and mechanism design, Myerson's classical regularity condition is often too weak for a quantitative analysis of performance. For instance, ratios between revenue and welfare, or sales probabilities may vanish at the boundary of Myerson regularity. This paper introduces L-regularity as...