IDEAS home Printed from https://ideas.repec.org/p/ris/smuesw/2021_003.html
   My bibliography  Save this paper

On the Decomposability of Fractional Allocations

Author

Listed:
  • Chatterji, Shurojit

    (School of Economics, Singapore Management University)

  • Liu, Peng

    (East China Normal University)

Abstract

A common practice in dealing with the allocation of indivisible objects is to treat them as infinitely divisible and specify a fractional allocation, which is then implemented as a lottery on integer allocations that are feasible. The question we study is whether an arbitrary fractional allocation can be decomposed as a lottery on an arbitrary set of feasible integer allocations. The main result is a characterization of decomposable fractional allocations, that is obtained by transforming the decomposability problem into a maximum flow problem. We also provide a separate necessary condition for decomposability.

Suggested Citation

  • Chatterji, Shurojit & Liu, Peng, 2021. "On the Decomposability of Fractional Allocations," Economics and Statistics Working Papers 3-2021, Singapore Management University, School of Economics.
    • Handle: RePEc:ris:smuesw:2021_003
    as

    Download full text from publisher

    File URL: https://ink.library.smu.edu.sg/soe_working_paper/4/
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Indivisibility; Fractional allocation; Decomposability; Maximum flow;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    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:ris:smuesw:2021_003. 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: Cheong Pei Qi (email available below). General contact details of provider: https://edirc.repec.org/data/sesmusg.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.