Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
This paper focuses on the fair division of a set of indivisible items between two people when both have the same linear preference order on the items but may have different preferences over subsets of items. Surprisingly, divisions that are envy-free, Pareto-optimal, and ensure that the less well-off person does as well as possible (i.e., are equitable) can often be achieved. Preferences between subsets are assumed to satisfy axioms of qualitative probability without implying the existence of additive utilities, which is treated as a special case. Algorithms that render fair division practicable are proposed, and their vulnerability to strategic manipulation is investigated.
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): 17 (2000)
Issue (Month): 2 ()
|Note:||Received: 18 May 1998/Accepted: 2 March 1999|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/355|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:17:y:2000:i:2:p:247-267. 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: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.