The proportional random allocation of indivisible units
Indivisible units are randomly allocated among agents with a claim/demand on the resources. The available resources fall short of the sum of individual claims. The proportional method distributes units sequentially, and the probability of receiving a unit at any step is proportional to the unsatisfied claims. We characterize the family of probabilistic rationing methods meeting the three axioms Consistency, Lower and Upper Composition. It contains the proportional method, all deterministic fixed priority methods, and the priority compositions of proportional methods. The proportional method is the only fair method in the family.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 19 (2002)
Issue (Month): 2 ()
|Note:||Received: 30 November 1999/Accepted: 15 November 2000|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:19:y:2002:i:2:p:381-413. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.