We investigate implementation of social choice functions with asymmetric information concerning the state from epistemological perspectives. While each agent is either selfish or honest, they do not expect other participants to be honest. Nevertheless, an honest agent may exist, not among the...

We investigate the implementation of social choice functions (SCFs) from an epistemological perspective. We consider the possibility that in higher-order beliefs there exists an honest agent who is motivated by intrinsic preference for honesty as well as material interest. We assume weak...

We consider the possibility that in a society where innately prosocial and adversarial agents exist albeit in the minority, the majority of agents behave honestly from two distinct perspectives. First, we consider a socioeconomic perspective in which the majority are influenced by their partners...

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

A jury has to choose the winner of a contest. There exists a deserving winner, whose identity is common knowledge among the jurors, but not known by the planner. Jurors may be biased in favor (friend) or against (enemy) some contestants. We study conditions on the confi?guration of the jury so...

We analyze the problem of choosing the w contestants who will win a competition within a group of nw competitors when all jurors commonly observe who are the w best contestants but may be biased. We study conditions on the configuration of the jury so that it is possible to induce the jurors to...

For groups that must make several decisions of similar form, we define a simple and general mechanism that is designed to promote social efficiency. The mechanism links the various decisions by forcing agents to budget their representations of preferences so that the frequency of preferences...