This paper studies a model of mechanism design with transfers where agents' preferences need not be quasilinear. In such a model, (1) we characterize dominant strategy incentive compatible mechanisms using a monotonicity property; (2) we establish a revenue uniqueness result: for every dominant...

This paper studies a model of mechanism design with transfers where agents' preferences need not be quasilinear. In such a model, (1) we characterize dominant strategy incentive compatible mechanisms using a monotonicity property; (2) we establish a revenue uniqueness result: for every dominant...

This paper explores the sale of an object to an ambiguity averse buyer. We show that the seller can increase his profit by using an ambiguous mechanism. That is, the seller can benefit from hiding certain features of the mechanism that he has committed to from the agent. We then characterize the...

We study optimal selling strategies of a seller who is poorly informed about the buyer’s value for the object. When the maxmin seller only knows that the mean of the distribution of the buyer's valuations belongs to some interval then nature can keep him to payoff zero no matter how much...

Models of choice where agents see others as less sophisticated than themselves have significantly different, sometimes more accurate, predictions in games than does Nash equilibrium. When it comes to mechanism design, however, they turn out to have surprisingly similar implications. This paper...

We study mechanisms for environments in which only some of the agents are directly connected to a mechanism designer and the other agents can participate in a mechanism only through the connected agents' referrals. In such environments, the mechanism designer and agents may have different...

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

Neeman (2004) and Heifetz and Neeman (2006) have shown that, in auctions with incomplete information about payoffs, full surplus extraction is only possible if agents’ beliefs about other agents are fully informative about their own payoff parameters. They argue that the set of...

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

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