Steven J. Brams () (Department of Politics, New York University, New York, NY 10003, USA Information Sciences Research, Room C227, AT&T Labs-Research, 180 Park Avenue, Florham Park, NJ 07932, USA) Peter C. Fishburn () (Department of Politics, New York University, New York, NY 10003, USA Information Sciences Research, Room C227, AT&T Labs-Research, 180 Park Avenue, Florham Park, NJ 07932, USA)
Additional information is available for the following
registered author(s):
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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. 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.