In de Clippel, Saran, and Serrano (2019), it is shown that, perhaps surprisingly, the set of implementable social choice functions is essentially the same whether agents have bounded depth of reasoning or rational expectations. The picture is quite different when taking into account the...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

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

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

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 consider mechanism design in contexts in which agents exhibit bounded depth of reasoning (level k ) instead of rational expectations. We use simple direct mechanisms, in which agents report only first-order beliefs. While level 0 agents are assumed to be truth tellers, level k agents...

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

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