Strategy-proofness, requiring that truth-telling be a dominant strategy, is a standard concept in social choice theory. However, this concept has serious drawbacks. In particular, many strategy-proof mechanisms have multiple Nash equilibria, some of which produce the wrong outcome. A possible...

This paper analyzes strategy-proof collective choice rules when individuals have single-crossing preferences on a finite and ordered set of social alternatives. It shows that a social choice rule is anonymous, unanimous, and strategy-proof on a maximal single-crossing domain if and only if it is...

The paper considers the communication complexity (measured in bits or real numbers) of Nash implementation of social choice rules. A key distinction is whether we restrict to the traditional one-stage mechanisms or allow multi-stage mechanisms. For one-stage mechanisms, the paper shows that for...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...

We generalize the canonical problem of Nash implementation by allowing agents to voluntarily provide discriminatory signals, i.e. evidence. Evidence can either take the form of hard information or, more generally, have differential but non-prohibitive costs in different states. In such...

In a moneyless market, a non storable, non transferable homogeneous commodity is reallocated between agents with single-peaked preferences. Agents are either suppliers or demanders. Transfers between a supplier and a demander are feasible only if they are linked, and the links form an arbitrary...

In a voting model where the set of feasible alternatives is a subset of a product set $A = A_1\times\cdots\ldots{}A_m$ of $m$ finite categories, we characterize the set of all strategy-proof social choice functions for three different types of preference domains over $A$, namely for the domains...

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns...

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

In this paper, we revisit a long-standing question on the structure of strategy-proof and Pareto-efficient social choice functions (SCFs) in classical exchange economies (Hurwicz (1972)). Using techniques developed by Myerson in the context of auction-design, we show that in a specific...