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

We study mechanism design problems in quasi-linear environments where the envelope theorem and revenue equivalence principle fail due to non-convex and non-differentiable valuations. We obtain a characterization of incentive compatibility based on the Mirrlees representation of the indirect...

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 optimal auction design when the seller can affect the buyersʼ valuations through an unobservable ex ante investment. The key insight is that the optimal mechanism may have the seller play a mixed investment strategy so as to create correlation between the buyersʼ otherwise...

We uncover a new necessary condition for implementation in iteratively undominated strategies by mechanisms that satisfy the “best element property” where for each agent, there exists a strategy profile that gives him the highest payoff in the mechanism. This class includes finite and...

We study a mechanism design problem where arbitrary restrictions are placed on the sets of first-order beliefs of agents. Calling these restrictions Δ, we use Δ-rationalizability (Battigalli and Siniscalchi, 2003, [5]) as our solution concept, and require that a mechanism virtually implement a...

We consider implementation of a deterministic allocation rule using transfers in quasi-linear private values environments. We show that in multidimensional single peaked type spaces, an allocation rule is implementable if and only if it satisfies a familiar and simple condition called 2-cycle...

In this paper we consider equilibrium behavior in a Dutch (descending price) auction when the bidders are uninformed of their valuations with probability q and can acquire information about their valuation with a positive cost during the auction. We assume that the information acquisition...

We provide new tools for studying asymmetric first price auctions, connecting their equilibria to the ρ-concavity of the underlying type distributions, and showing how one can use surplus expressions for symmetric auctions to bound equilibrium behavior in asymmetric auctions. We apply these...

We characterize revenue maximizing mechanisms in auction settings with ‘rich’ type spaces, where bidders obtain information from sources other than their own valuation. By considering a relaxed problem, we provide an upper bound on revenue extraction that explicitly builds on the richness of...