This note studies (full) implementation of social choice functions under complete information in (correlated) rationalizable strategies. The monotonicity condition shown by Maskin (1999) to be necessary for Nash implementation is also necessary under the more stringent solution concept. We show...

We prove a general possibility result for collective decision problems where individual allocations are one-dimensional, preferences are single-peaked (strictly convex), and feasible allocation profiles cover a closed convex set. Special cases include the celebrated median voter theorem (Black...

In mechanism design, Myerson regularity is often too weak for a quantitative analysis of performance. For instance, ratios between revenue and welfare, or sales probabilities may vanish at the boundary of Myerson regularity. This paper therefore explores the quantitative version of Myerson...

In auction and mechanism design, Myerson's classical regularity condition is often too weak for a quantitative analysis of performance. For instance, ratios between revenue and welfare, or sales probabilities may vanish at the boundary of Myerson regularity. This paper introduces L-regularity as...

In mechanism design, Myerson regularity is often too weak for a quantitative analysis of performance. For instance, ratios between revenue and welfare, or sales probabilities may vanish at the boundary of Myerson regularity. This paper therefore explores the quantitative version of Myerson...

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

A mediator, with no prior information and no control over the market protocol, attempts to redesign the information structure in the market by running an information intermediation mechanism with transfers that first elicits information from an agent, and then discloses information to another...

I study a principal's optimal choice of constraint for an agent participating in an auction (or auction-like allocation mechanism). I give necessary and sufficient conditions on the principal's beliefs about the value of the item for a simple budget constraint to be the optimal contract. 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...