A private commodity is divided among agents with single peaked preferences over their share. A rationing method elicits individual peaks (demands); if the commodity is overdemanded (resp. underdemanded), no agent receives more (resp. less) than his peak. A fixed path rationing method allocates an overdemanded "good" along a path independent of individual demands, except that an agent receives exactly his demand if it is below the path-generated share. An underdemanded "bad" is allocated along another such path, except that an agent who demands more than his path-generated share receives exactly his peak. We consider four properties of allocation mechanisms: efficiency, strategyproofness, resource monotonicity, and consistency. Together, these axioms characterize precisely the set of fixed path rationing methods. The result holds when the commodity is infinitely divisible and when it comes in indivisible units.
