Maximal Domain of Preferences in the Division Problem

MASSÓ J. AND NEME A.

Games and Economic Behavior

ELSEVIER

Año: 2001 vol. 37 p. 367 - 387

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform allocation rule is the unique strategy-proof, efficient, and anonymous rule. We identify the maximal set of preferences, containing the set of single-peaked preferences, under which there exists at least one rule satisfying the properties of strategy-proofness, efficiency, and strong symmetry. In addition, we show that our characterization implies a slightly weaker version of Ching and Serizawa (1998) result.