The form of contests for a single fixed prize can be determined by a designer who maximizes the contestants' efforts. This paper establishes that, under common knowledge of the two asymmetric contestants' prize valuations, a fair Tullock-type endogenously determined lottery is always superior to...

A mechanism is unsafe if a small number of agents deviating unexpectedly can make the mechanism deliver an outcome regarded as bad by a large number of other agents. Under Nash behavior, the direct approach of designing mechanisms with only safe Nash equilibria is impossible in many...

We study subgame-perfect implementation (SPI) mechanisms that have been proposed as a solution to incomplete contracting problems. We show that these mechanisms — which are based on off-equilibrium arbitration clauses that impose large fines for lying and the inappropriate use of arbitration...

We conducted laboratory experiments for the multi-unit Vickrey auction with and without advice to subjects on strategy-proofness. The rate of truth-telling among the subjects without advice was 20%, whereas the rate increased to 47% among those who received advice. By conducting similar...

A new mechanism was introduced in New York City and Boston to assign students to public schools. This mechanism was advocated for its superior fairness property, besides others. We introduce a new framework for school-choice problems and two notions of fairness in lottery design based on ex-ante...

We develop an analysis of voting rules that is robust in the sense that we do not make any assumption regarding voters' knowledge about each other. In dominant strategy voting rules, voters' behavior can be predicted uniquely without making any such assumption. However, on full domains, the only...

We conduct laboratory experiments for the Vickrey auction with and without an announcement on strategy-proofness to subjects. Although the rate of truth-telling among the subjects stays at 20% without the announcement, it increases to 47% with the announcement. Moreover, by conducting...

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

We study subgame-perfect implementation (SPI) mechanisms that have been proposed as a solution to incomplete contracting problems. We show that these mechanisms - which are based on off-equilibrium arbitration clauses that impose large fines for lying and the inappropriate use of arbitration -...

We study dominant strategy incentive compatible (DIC) and deterministic mechanisms in a social choice setting with several alternatives. The agents are privately informed about their preferences, and have single-crossing utility functions. Monetary transfers are not feasible. We use an...