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

This paper considers an implementation problem with bounded rationality of the agents. Bounded rationality presented here means that the agent might choose the agent's best response which is different from the agent's dominant strategy. To describe such a behavior, this paper introduces a new...

Can mechanism design save democracy? We propose a simple design that offers a chance: individuals pay for as many votes as they wish using a number of "voice credits" quadratic in the votes they buy. Only quadratic cost induces marginal costs linear in votes purchased and thus welfare optimality...

This online appendix proves the central result in Lalley and Weyl (Forthcoming). The full text PDF for "Qaudratic Voting: How Mechanism Design Can Radicalize Democracy" may be found here: http://ssrn.com/abstract=2003531

How should a group of people decide to allocate a task that has to be done but is not adequately rewarded? This paper finds an optimal mechanism for the private provision of a public service in an environment without monetary transfers. All members of the group have the same cost of providing...

We consider mechanism design in contexts in which agents exhibit bounded depth of reasoning (level k ) instead of rational expectations. We use simple direct mechanisms, in which agents report only first-order beliefs. While level 0 agents are assumed to be truth tellers, level k agents...

Models of choice where agents see others as less sophisticated than themselves have significantly different, sometimes more accurate, predictions in games than does Nash equilibrium. When it comes to mechanism design, however, they turn out to have surprisingly similar implications. This paper...

We study mechanisms for environments in which only some of the agents are directly connected to a mechanism designer and the other agents can participate in a mechanism only through the connected agents' referrals. In such environments, the mechanism designer and agents may have different...

We study full implementation with evidence in an environment with bounded utilities. We show that a social choice function is Nash implementable in a direct revelation mechanism if and only if it satisfies the measurability condition proposed by Ben-Porath and Lipman (2012). Building on a novel...

We present a new and simple mechanism for repeated public good environments. In the Conditional Contribution Mechanism (CCM), agents send two message of the form, "I am willing to contribute x units to the public good if in total y units are contributed." This mechanism offers agents risk-free...