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

Random Assignment of Bundles

Author

Listed:
  • Chatterji, Shurojit

    (School of Economics, Singapore Management University)

  • Liu, Peng

    (School of Economics, Singapore Management University)

Abstract

We study the random assignments of bundles with no free disposal. The key difference between the setting with bundles and the setting with objects (see Bogomolnaia and Moulin (2001)) is one of feasibility. The implications of this difference are significant. First, the characterization of sd-efficient random assignments is fundamentally different. Second, a possibility result in the setting with objects fails in the setting with bundles. However, in the setting with bundles, we are able to identify a preference restriction, called essential monotonicity, under which the random serial dictatorship rule (extended to the setting with bundles) is equivalent to the probabilistic serial rule (extended to the setting with bundles). This equivalence implies the existence of a rule on this restricted domain satisfying sdefficiency, sd-strategy-proofness, and equal treatment of equals. Moreover, this rule selects only random assignments which can be decomposed as convex combinations of deterministic assignments.

Suggested Citation

  • Chatterji, Shurojit & Liu, Peng, 2018. "Random Assignment of Bundles," Economics and Statistics Working Papers 18-2018, Singapore Management University, School of Economics.
    • Handle: RePEc:ris:smuesw:2018_018
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Chatterji, Shurojit & Liu, Peng, 2020. "Random assignments of bundles," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 15-30.

    More about this item

    Keywords

    Random assignments; bundles; decomposability; sd efficiency; sd-strategyproofness; equal treatment of equals;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

    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:2018_018. 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.