Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
AbstractThis 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.
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal Social Choice and Welfare.
Volume (Year): 17 (2000)
Issue (Month): 2 ()
Note: Received: 18 May 1998/Accepted: 2 March 1999
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Nicolò, Antonio & Yu, Yan, 2008.
"Strategic divide and choose,"
Games and Economic Behavior,
Elsevier, vol. 64(1), pages 268-289, September.
- Steven Brams & D. Kilgour & Christian Klamler, 2012.
"The undercut procedure: an algorithm for the envy-free division of indivisible items,"
Social Choice and Welfare,
Springer, vol. 39(2), pages 615-631, July.
- Brams, Steven J. & Kilgour, D. Marc & Klamler, Christian, 2009. "The undercut procedure: an algorithm for the envy-free division of indivisible items," MPRA Paper 12774, University Library of Munich, Germany.
- Saralees Nadarajah, 2009. "The Pareto optimality distribution," Quality & Quantity: International Journal of Methodology, Springer, vol. 43(6), pages 993-998, November.
- Eve Ramaekers, 2013.
"Fair allocation of indivisible goods: the two-agent case,"
Social Choice and Welfare,
Springer, vol. 41(2), pages 359-380, July.
- RAMAEKERS, Eve, . "Fair allocation of indivisible goods: the two-agent case," CORE Discussion Papers RP -2483, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Fragnelli, Vito & Marina, Maria Erminia, 2003. "A fair procedure in insurance," Insurance: Mathematics and Economics, Elsevier, vol. 33(1), pages 75-85, August.
- Dall'Aglio, Marco & Mosca, Raffaele, 2007. "How to allocate hard candies fairly," Mathematical Social Sciences, Elsevier, vol. 54(3), pages 218-237, December.
- Edelman, Paul & Fishburn, Peter, 2001. "Fair division of indivisible items among people with similar preferences," Mathematical Social Sciences, Elsevier, vol. 41(3), pages 327-347, May.
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.