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

We consider full implementation in complete-information environments when agents have an arbitrarily small preference for honesty. We offer a condition called separable punishment and show that when it holds and there are at least two agents, any social choice function can be implemented by a...

We analyze the problem of aggregating judgments over multiple issues from the perspective of whether aggregate judgments manage to efficiently use all voters' private information. While new in judgment aggregation theory, this perspective is familiar in a different body of literature about...

We examine a model of limited communication in which the seller is selling a single good to two potential buyers. In each of the finite number of periods the seller asks one of the two buyers a binary question. After the final answer, the allocation and the transfers are executed. The model...

In the presence of self-interested parties, mechanism designers typically aim to implement some social-choice function in an equilibrium. This paper studies the cost of such equilibrium requirements in terms of communication. While a certain amount of information x needs to be communicated just...

Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of them also take into account self-interested agents and consequent strategic issues, but these papers focus on...

We study a mechanism design problem in which players can take part in a mechanism to coordinate their actions in a default game. By refusing to participate in the mechanism, a player can revert to playing the default game non-cooperatively. We show with an example that some allocation rules are...

We study auctions under restricted communication. Agents have valuations distributed over an interval but can only report one of a finite number of messages. We provide necessary conditions for welfare as well as revenue maximizing auctions in the independent private values case when bidders...

A number of identical objects is allocated to a set of privately informed agents. Agents have linear utility in money. The designer wants to assign objects to agents that possess specific traits, but the allocation can only be conditioned on the willingness to pay and on observable...

We study the second best in a single unit sale to two bidders. This is the allocation that maximizes the expected social surplus subject to the biddersʼ incentive compatible constraints when the first best is not implementable. We prove that Maskinʼs (1992) result that any first best...