We argue that when externalities such as pollution are nonexcludable, agents must be compelled to participate in a “mechanism” to ensure a Pareto-efficient outcome. We survey some of the main findings of the mechanism-design (implementation-theory) literature – such as the Nash...

The paper considers a voting model where each voter's type is her preference. The type graph for a voter is a graph whose vertices are the possible types of the voter. Two vertices are connected by an edge in the graph if the associated types are "neighbors." A social choice function is locally...

This study explores mechanism design with allocation-based social preferences. Agents' social preferences and private payoffs are all subject to asymmetric information. We assume quasi-linear utility and independent types. We show how the asymmetry of information about agents' social preferences...

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

In a large economy, a first-best provison rule for a public good is robustly implementable with budget balance because no one individual alone can affect the aggregate outcome. First-best outcomes can, however, be blocked by coalitions of agents acting in concert. With a requirement of immunity...

We propose a new family of mechanisms, whereby players may give more or less directly to one another. A cornerstone case is the regular linear public goods mechanism (LPGM), where all contribute into a single common group account, the total amount of which is then distributed equally among...

Many real-world mechanisms are “noisy” or “fuzzy”, that is the institutions in place to implement them operate with non-negligible degrees of imprecision and error. This observation raises the more general question of whether mechanisms that work in theory are also robust to more...