We design a non-clairvoyant dynamic mechanism under budget and ex-post individual rationality constraints that is dynamic incentive-compatible and achieves non-trivial revenue performance, even without any knowledge about the future. In particular, our dynamic mechanism obtains a constant...

We introduce a new family of dynamic mechanisms that restricts sellers from using future distributional knowledge. Since the allocation and pricing of each auction period do not depend on the type distributions of future periods, we call this family of dynamic mechanisms non-clairvoyant.We...

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

Governments must usually take policy decisions with an imperfect knowledge of the economic actors' type or the actors' effort level. These issues are addressed within the framework of classic adverse selection or moral hazard models. I discuss in this paper how would the government’s and the...

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

The common-support assumption of future type distributions is standard in the dynamic mechanism design literature (e.g., Baron and Besanko, 1984, Courty and Li, 2000, Eső and Szentes, 2007, Krähmer and Strausz, 2011, and Pavan, Segal, and Toikka, 2014). It is widely perceived that the...

Consider a mechanism design setting in which agents acquire costly information about an unknown, payoff-relevant state of nature. Information gathering is covert. We investigate conditions under which (i) efficient implementation and (ii) full surplus extraction are Bayesian incentive compatible...

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