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

We consider the standard mechanism design environment with linear utility but without monetary transfers. We first establish an equivalence between deterministic, dominant strategy incentive compatible mechanisms and generalized median voter schemes. We then use this equivalence to construct the...

We consider a general economy, where agents have private information about their types. Types can be multi-dimensional and potentially interdependent. We show that, if the realized frequency of types (the exact number of agents for each type) is common knowledge, then a mechanism exists, which...

When an individual performs several tasks simultaneously, resources must be allocated to different brain systems to produce energy for neurons to fire. Following the evidence from neuroscience, we model the brain as an organization in which a coordinator allocates limited resources to the brain...

Every agent reports his willingness to pay for one unit of good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an...

Agents are farsighted when they consider the ultimate results to which their own actions may lead to. We re-examine the classical questions of implementation theory under complete information in a setting with transfers where farsighted coalitions are regarded as fundamental behavioral units and...

Every agent reports his willingness to pay for one unit of a good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an...