We consider the problem of regulating an economy with environmental pollution. We examine the distributional impact of the polluter-pays principle which requires that any agent compensates all other agents for the damages caused by his or her (pollution) emissions. With constant marginal damages...

With diminishing global water reserves the problem of water allocation becomes increasingly important. We consider the problem of efficiently sharing a river among a group of satiable countries. Inducing countries to efficiently cooperate requires monetary compensations via international...

A group of agents located along a river have quasi-liner preferences over water and money. We ask how water should be allocated and what money transfers should be performed.

This paper addresses the question of whether R&D should be carried out by an independent research unit to be produced in-house by the firm marketing the innovation.

Moulin (1999) characterizes the fixed-path rationing methods by efficiency, strategy-proofness, consistency, and resource-monotonicity. In this note, we give a straightforward proof of his result.

We study the problem of locating two public Godds for a group of agents with single-peaked preferences over an interval.

We consider a probabilistic approach to the problem of assigning K indivisible identical objects to a set of agents with single-peaked preferences. Using the ordinal extension of preferences, we characterize the class of uniform probabilistic rules by Pareto efficiency, strategy-proofness, and...

We study the simple model of assigning indivisible and heterogenous objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. For this model, known as the house allocation model, we characterize the class of rules...

We consider envy-free (and budget-balanced) rules that are least manipulable with respect to agents counting or with respect to utility gains. Recently it has been shown that for any profile of quasi-linear preferences, the outcome of any such least manipulable envy-free rule can be obtained via...

We study a general class of priority-based allocation problems with weak priority orders and identify conditions under which there exists a strategy-proof mechanism which always chooses an agent-optimal stable, or constrained efficient, matching. A priority structure for which these two...