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 derive several implications of incentive compatibility in general (i.e., not necessarily quasilinear) environments. Building on Kos and Messner (2013), we provide a (partial) characterization of incentive compatible mechanisms.

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

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

Under appropriate assumptions (private values and uniform punishments), the Nash equilibria of a Bayesian repeated game without discounting are payoff-equivalent to tractable, completely revealing, equilibria and can be achieved as interim cooperative solutions of the initial Bayesian game. This...

We showed in McLean and Postlewaite (2014) that when agents are informationally small, there exist small modifications to VCG mechanisms in interdependent value problems that restore incentive compatibility. This paper presents a two-stage mechanism that similarly restores incentive...

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

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

We survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents or buyers whose private information remains fixed throughout time; and those with a fixed population of agents or buyers whose private...