A group of heterogeneous agents may form partnerships in pairs. All single agents as well as all partnerships generate values. If two agents choose to cooperate, they need to specify how to split their joint value among one another. In equilibrium, which may or may not exist, no agents have...

Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multi-item auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey–English–Dutch auction and it contains the...

This paper revisits manipulation via capacities in centralized two-sided matching markets. Sönmez (1997) showed that no stable mechanism is non-manipulable via capacities. We show that non-manipulability via capacities can be equivalently described by two types of non-manipulation via...

We consider the problem of efficiently sharing water from a river among a group of satiable agents. Since each agent's benefit function exhibits a satiation point, the environment can be described as a cooperative game with externalities. We show that the downstream incremental distribution is...

In one-dimensional environments with single-peaked preferences we consider social welfare functions satisfying Arrow's requirements, i.e. weak Pareto and independence of irrelevant alternatives. When the policy space is a one-dimensional continuum such a welfare function is determined by a...