Individually rational rules for the division problem when the number of units to be allotted is endogenous

摘要

We study individually rational rules to be used to allot, among a group of agents, a perfectly divisible good that is freely available only in whole units. A rule is individually rational if, at each preference profile, each agent finds that her allotment is at least as good as any whole unit of the good. We study and characterize two individually rational and efficient families of rules, whenever agents' preferences are symmetric single-peaked on the set of possible allotments. Rules in the two families are in addition envy-free, but they differ on whether envy-freeness is considered on losses or on awards. Our main result states that (a) the family of constrained equal losses rules coincides with the class of all individually rational and efficient rules that satisfy justified envy-freeness on losses and (b) the family of constrained equal awards rules coincides with the class of all individually rational and efficient rules that satisfy envy-freeness on awards.