IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2404.04822.html
   My bibliography  Save this paper

Some Characterizations of TTC in Multiple-Object Reallocation Problems

Author

Listed:
  • Jacob Coreno
  • Di Feng

Abstract

This paper considers reallocation of indivisible objects when agents are endowed with and can consume any bundles. We obtain characterizations of generalized versions of the Top Trading Cycles (TTC) rule on several preference domains. On the lexicographic domain, the TTC rule is uniquely determined by balancedness, Pareto efficiency, the worst endowment lower bound, and either truncation-proofness or drop strategy-proofness. On the more general responsive domain, the TTC rule is the unique individual-good-based rule that satisfies balancedness, individual-good efficiency, truncation-proofness, and either individual rationality or the worst endowment lower bound. On the conditionally lexicographic domain, the augmented TTC rule is characterized by balancedness, Pareto efficiency, the worst endowment lower bound, and drop strategy-proofness. The conditionally lexicographic domain is a maximal domain on which Pareto efficiency coincides with individual-good efficiency. For the housing market introduced by Shapley and Scarf (1974), the TTC rule is characterized by Pareto efficiency, individual rationality, and truncation-proofness.

Suggested Citation

  • Jacob Coreno & Di Feng, 2024. "Some Characterizations of TTC in Multiple-Object Reallocation Problems," Papers 2404.04822, arXiv.org, revised Nov 2024.
    • Handle: RePEc:arx:papers:2404.04822
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2404.04822
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    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:arx:papers:2404.04822. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.