IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/109395.html
   My bibliography  Save this paper

Two-Person Fair Division of Indivisible Items: Compatible and Incompatible Properties

Author

Listed:
  • Brams, Steven J.
  • Kilgour, Marc
  • Klamler, Christian

Abstract

Suppose two players wish to divide a finite set of indivisible items, over which each distributes a specified number of points. Assuming the utility of a player’s bundle is the sum of the points it assigns to the items it contains, we analyze what divisions are fair. We show that if there is an envy-free (EF) allocation of the items, two other desirable properties—Pareto-optimality (PO) and maximinality (MM)—can also be satisfied, rendering these three properties compatible, but other properties—balance (BL), maximum Nash welfare (MNW), maximum total welfare (MTW), and lexicographic optimality (LO)—may fail. If there is no EF division, as is likely, it is always possible to satisfy EFx, a weaker form of EF, but an EFx allocation may not be PO, BL, MNW, MTW, or LO. Moreover, if one player considers an item worthless (i.e., assigns zero points to it), an EFx division may be Pareto dominated by a nonEFx allocation that is MNW. Although these incompatibilities suggest that there is no “perfect” 2-person fair division of indivisible items, EFx and MNW divisions—if they give different allocations when there is no EF-PO-MM division—seem the most compelling alternatives, with EFx, we conjecture, satisfying the Rawlsian objective of helping the worse-off player and MNW, a modification of MTW, suggesting a more Benthamite view.

Suggested Citation

  • Brams, Steven J. & Kilgour, Marc & Klamler, Christian, 2021. "Two-Person Fair Division of Indivisible Items: Compatible and Incompatible Properties," MPRA Paper 109395, University Library of Munich, Germany.
  • Handle: RePEc:pra:mprapa:109395
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/109395/1/MPRA_paper_109395.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Two-person fair division; indivisible items; envy-freeness;
    All these keywords.

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D6 - Microeconomics - - Welfare Economics
    • D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
    • D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:109395. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.