Priority Rules and Other Inequitable Rationing MethodsHerve Moulin () No 98-03, Working Papers from Duke University, Department of Economics Abstract: In a rationing problem, each agent demands a quantity of a certain commodity and the available resources fall short of total demand. A rationing method solves this problem at every level of resources and individual demands. We impose three axioms: Consistency (with respect to variations of the set of agents), Distributivity, and Distributivity (with respect to variations of the available resources). In the model where the commodity comes in indivisible units, the three axioms characterize the family of priority rules, where individual demands are met lexicographically according to an exogeneous ordering of the agents. In the (more familiar) model where the commodity is divisible, these three axioms plus Scale Invariance(independence of the measurement unit(characterize a rich family of methods. It contains exactly three equitable methods, giving equal shares to equal demands: these are the familiar proportional, uniform gains and uniform losses methods. The inequitable methods in the family partition the agents into priority classes; within each class, they use either the proportional method or an asymmetric weighted version of the uniform gains or uniform losses methods. JEL-codes: D63 D70 (search for similar items in EconPapers) Published in ECONOMETRICA, Vol. 68, 2000, pages 643-684 There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: http://EconPapers.repec.org/RePEc:duk:dukeec:98-03 Access Statistics for this paper More papers in Working Papers from Duke University, Department of Economics |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
Swedish Business School at Örebro University.