Abstract:
We investigate the distributional properties of the uniform rule for the problem of allocating an infinitely divisible commodity among a group of is the only subsolution of the convex no-envy and Pareto solution. Next, we show that the uniform rule offers the greatest upper bound when there is too little of the commodity, and the least lower bound when there is too much of the commodity.