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 a contract design setting in which the contracting parties cannot commit not to renegotiate previous contract agreements. In particular, we characterize the outcome functions that are implementable for an uninformed principal and an informed agent if, having observed the agent's...

In a class of informed principal problems with common values, we define iteratively a particular allocation which we call the assured allocation. It is comparatively easy to calculate and straightforward to interpret. It always exists, is unique and continuous in the priors. It is undominated,...

We consider the provision of an abstract service to single-dimensional agents. Our model includes position auctions, single-minded combinatorial auctions, and constrained matching markets. When the agents' values are drawn independently from a distribution, the Bayesian optimal mechanism is...

This essay introduces the symposium on computer science and economic theory.

This paper characterizes the set of equilibrium payoffs in bargaining with interdependent values when the informed party makes all offers, as discounting vanishes. The seller of a good is informed of its quality, which affects both his cost and the buyer's valuation, but the buyer is not. To...

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 extend implementation theory by allowing the social choice function to depend on more than just the preferences of the agents and allowing agents to support their statements with hard evidence. We show that a simple condition on evidence is necessary for the implementation of a social choice...

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

I extend Myersonʼs [R. Myerson, Optimal auction design, Math. Oper. Res. 6 (1981) 58–73] ironing technique to more general objective functions. The approach is based on a generalized notion of virtual surplus which can be maximized pointwise even when the monotonicity constraint implied by...