In the division problem with single-peaked preferences, it is well known that the uniform rule is robust to strategic manipulation. Furthermore, under efficiency and symmetry, it is the unique strategy-proof rule (Sprumont, 1991; Ching, 1994). We conversely analyze the consequences of strategic...

Consider the problem of exact Nash Implementation of social choice correspondences. Define a lottery mechanism as a mechanism in which the planner can randomize on alternatives out of equilibrium while pure alternatives are always chosen in equilibrium. When preferences over alternatives are...

Truthtelling is often viewed as focal in direct mechanisms. We introduce two new notions of robust implementation based on the premise that society may be composed of "primitive'' agents who, whenever confronted with a strategy profile, anchor to truthtelling and make a limited number of...

A central result in the literature on bargaining with asymmetric information is that the uninformed party (buyer) can screen the informed party (seller) over time. Screening eliminates trade failures that are otherwise common in the presence of adverse selection, but the downside of the...

In markets with asymmetric information, where equilibria are often inefficient, bargaining can help promote welfare. We design an experiment to examine the impact of competition and price transparency in such settings. Consistent with the theoretical predictions, we find that competition...

Domains of individual preferences for which the well-known impossibility theorems of Gibbard-Satterthwaite and Muller-Satterthwaite do not hold are studied. To comprehend the limitations these results imply for social choice rules, we search for the largest domains that are possible. Here, we...