Morimoto, Shuhei Serizawa, Shigehiro Ching, Stephen
Year of Publication:
ISER Discussion Paper No. 769
We consider the problem of allocating infinitely divisible commodities among a group of agents. Especially, we focus on the case where there are several commodities to be allocated, and agents have continuous, strictly convex, and separable preferences. In this paper, we establish that the uniform rule is the only rule satisfying strategy-proofness, unanimity, symmetry, and nonbossiness.
strategy-proofness several infinitely divisible commodities uniform rule separable preferences