Advanced Search
MyIDEAS: Login

On Fair Allocations and Indivisibilities

Contents:

Author Info

  • Ning Sun

    (Akita Prefectural University)

  • Zaifu Yang

    (Yokohama National University)

Registered author(s):

    Abstract

    This paper studies the problem of how to distribute a set of indivisible objects with an amount M of money among a number of agents in a fair way. We allow any number of agents and objects. Objects can be desirable or undesirable and the amount of money can be negative as well. In case M is negative, it can be regarded as costs to be shared by the agents. The objects with the money will be completely distributed among the agents in a way that each agent gets a bundle with at most one object if there are more agents than objects, and gets a bundle with at least one object if objects are no less than agents. We prove via an advanced fixed point argument that under rather mild and intuitive conditions the set of envy-free and efficient allocations is nonempty. Furthermore we demonstrate that if the total amount of money varies in an interval [X,Y], then there exists a connected set of fair allocations whose end points are allocations with sums of money equal to X and Y, respectively. Welfare properties are also analyzed when the total amount of money is modeled as a continuous variable. Our proof is based on a substantial generalization of the classic lemma of Knaster, Kuratowski and Mazurkewicz (KKM) in combinatorial topology.

    Download Info

    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.
    File URL: http://cowles.econ.yale.edu/P/cd/d13a/d1347.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Cowles Foundation for Research in Economics, Yale University in its series Cowles Foundation Discussion Papers with number 1347.

    as in new window
    Length: 23 pages
    Date of creation: Dec 2001
    Date of revision:
    Handle: RePEc:cwl:cwldpp:1347

    Contact details of provider:
    Postal: Yale University, Box 208281, New Haven, CT 06520-8281 USA
    Phone: (203) 432-3702
    Fax: (203) 432-6167
    Web page: http://cowles.econ.yale.edu/
    More information through EDIRC

    Order Information:
    Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA

    Related research

    Keywords: Indivisibility; fairness; Pareto optimality; resource allocation; multiperson decision; KKM lemma;

    Find related papers by JEL classification:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Sun, Ning & Yang, Zaifu, 2003. "A general strategy proof fair allocation mechanism," Economics Letters, Elsevier, vol. 81(1), pages 73-79, October.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:1347. 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: (Glena Ames).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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