Objects of different quality are to be allocated to agents. Agents can receive at most one object, and there are not enough high-quality objects for every agent. The value to the social planner from allocating objects to any given agent depends on that agent's private information. The social...

We study the formation of coalitions that provide public goods to members. Individuals are linked on a tree graph and those with similar preferences are connected on the tree. We present a solution that selects allocations belonging to the coalition structure core and that are also envy-free.

We consider the provision of an abstract service to single-dimensional agents. Our model includes position auctions, single-minded combinatorial auctions, and constrained matching markets. When the agents' values are drawn independently from a distribution, the Bayesian optimal mechanism is...

This essay introduces the symposium on computer science and economic theory.

We extend implementation theory by allowing the social choice function to depend on more than just the preferences of the agents and allowing agents to support their statements with hard evidence. We show that a simple condition on evidence is necessary for the implementation of a social choice...

We consider implementation issues regarding two mechanisms that have been used to increase voter turnout in elections: fines and lotteries. We focus on the amount of the fine or lottery prize needed to achieve full participation. We then propose a combined, self-financing mechanism by which the...

This paper characterizes the class of communication networks for which, in any environment (utilities and beliefs), every incentive-compatible social choice function is (partially) implementable. Among others, in environments with either common and independent beliefs and private values or a bad...

The ability of a long-lived seller to maintain and profit from a good reputation may induce her to provide high quality or effort despite short-run incentives to the contrary. This incentive remains in place with private monitoring, provided that buyers share their information. However, this...

We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n-1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation--as these terms are used in the...