Strategy-Proof Allotment Rules

Abstract

We consider the problem of alloting shares of a task or good among agents with single peaked preferences over their own shares. Previous characterizations have examined rules, such as the uniform rule, which satisfy various symmetry requirements. We consider the case where agents might begin with natural claims to minimal or maximal allotments, or might be treated with different priorities. We provide characterizations of the rules which are strategy-proof and efficient, but may treat individuals asymmetrically.