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

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

This note establishes a revelation principle in terms of payoff for deterministic mechanisms under ex-post constraints: the maximal payoff implementable by a feasible deterministic mechanism can also be implemented by a feasible deterministic direct mechanism.

We study a problem of optimal auction design in the realistic case in which the players can collude both on the way they play in the auction and on their participation decisions. Despite the fact that the principal's opportunities for extracting payments from the agents in such a situation are...

We give a sufficient condition on the type space for revenue equivalence when the set of social alternatives consists of probability distributions over a finite set. Types are identified with real-valued functions that assign valuations to elements of this finite set, and the type space is...

A speaker wishes to persuade a listener to take a certain action. The conditions under which the request is justified, from the listener’s point of view, depend on the state of the world, which is known only to the speaker. Each state is characterized by a set of statements from which the...

I study a principal's optimal choice of constraint for an agent participating in an auction (or auction-like allocation mechanism). I give necessary and sufficient conditions on the principal's beliefs about the value of the item for a simple budget constraint to be the optimal contract. The...

It is well-known that the ability of the Vickrey-Clarke-Groves (VCG) mechanism to implement efficient outcomes for private value choice problems does not extend to interdependent value problems. When an agent's type affects other agents' utilities, it may not be incentive compatible for him to...

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

We show that a solution to the problem of mechanism selection by an informed principal exists in a large class of environments with “generalized private values”: the agents’ payoff functions are independent of the principal’s type. The solution is an extension of Maskin and Tirole’s...