IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v233y2023ics0165176523004093.html
   My bibliography  Save this article

A characterization of Top Trading Cycles under trading networks

Author

Listed:
  • Afacan, Mustafa Oğuz

Abstract

We consider an object reallocation problem within a specific class of trade restrictions. An agent can only receive the object of someone else connected to him, which is referred to as feasibility. We introduce a Network Augmented Top Trading Cycles (NTTC) mechanism. Our main result shows that a mechanism is NTTC if and only if it is feasible, individually rational, constrained efficient, and strategy-proof.

Suggested Citation

  • Afacan, Mustafa Oğuz, 2023. "A characterization of Top Trading Cycles under trading networks," Economics Letters, Elsevier, vol. 233(C).
    • Handle: RePEc:eee:ecolet:v:233:y:2023:i:c:s0165176523004093
    DOI: 10.1016/j.econlet.2023.111383
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176523004093
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econlet.2023.111383?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Julien Combe & Umut Mert Dur & Olivier Tercieux & Camille Terrier & M. Utku Ünver, 2022. "Market Design for Distributional Objectives in (Re)assignment: An Application to Improve the Distribution of Teachers in Schools," Boston College Working Papers in Economics 1050, Boston College Department of Economics.
    2. Umut Mert Dur & M. Utku Ünver, 2019. "Two-Sided Matching via Balanced Exchange," Journal of Political Economy, University of Chicago Press, vol. 127(3), pages 1156-1177.
    3. Ekici, Özgün, 2024. "Pair-efficient reallocation of indivisible objects," Theoretical Economics, Econometric Society, vol. 19(2), May.
    4. Ma, Jinpeng, 1994. "Strategy-Proofness and the Strict Core in a Market with Indivisibilities," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(1), pages 75-83.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Ekici, Özgün & Sethuraman, Jay, 2024. "Characterizing the TTC rule via pair-efficiency: A short proof," Economics Letters, Elsevier, vol. 234(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Afacan, Mustafa Oğuz & Hu, Gaoji & Li, Jiangtao, 2024. "Housing markets since Shapley and Scarf," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    2. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    3. Jay Sethuraman & Bettina Klaus & Flip Klijn, 2024. "A Characterization of the Top-Trading-Cycles Mechanism for Housing Markets via Respecting-Improvement," Working Papers 1468, Barcelona School of Economics.
    4. Combe, Julien & Schlegel, Jan Christoph, 2024. "Reallocation with priorities," Games and Economic Behavior, Elsevier, vol. 143(C), pages 287-299.
    5. Hu, Xinquan & Zhang, Jun, 2024. "Characterization of Top Trading Cycles with single-dipped preferences," Economics Letters, Elsevier, vol. 241(C).
    6. Julien Combe, 2023. "Reallocation with priorities and minimal envy mechanisms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(2), pages 551-584, August.
    7. Bettina Klaus, 2024. "Characterizing the top trading cycles rule for housing markets with lexicographic preferences," Papers 2410.16745, arXiv.org.
    8. Biró, Péter & Klijn, Flip & Pápai, Szilvia, 2022. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Games and Economic Behavior, Elsevier, vol. 136(C), pages 428-453.
    9. Ekici, Özgün & Sethuraman, Jay, 2024. "Characterizing the TTC rule via pair-efficiency: A short proof," Economics Letters, Elsevier, vol. 234(C).
    10. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    11. Yajing Chen & Zhenhua Jiao & Chenfeng Zhang & Luosai Zhang, 2021. "The Machiavellian frontier of top trading cycles," Papers 2106.14456, arXiv.org, revised Apr 2024.
    12. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    13. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    14. Kirill Rudov, 2024. "Fragile Stable Matchings," Papers 2403.12183, arXiv.org.
    15. Aslan, Fatma & Lainé, Jean, 2020. "Competitive equilibria in Shapley–Scarf markets with couples," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 66-78.
    16. Jinpeng Ma, 1998. "Strategic Formation of Coalitions," Departmental Working Papers 199810, Rutgers University, Department of Economics.
    17. Tommy ANDERSSON & Lars EHLERS & Lars-Gunnar SVENSSON, 2014. "Transferring Ownership of Public Housing to Existing Tenants : A Mechanism Design Approach," Cahiers de recherche 09-2014, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    18. Sonmez, Tayfun, 1996. "Implementation in generalized matching problems," Journal of Mathematical Economics, Elsevier, vol. 26(4), pages 429-439.
    19. Alcalde-Unzu, Jorge & Molis, Elena, 2011. "Exchange of indivisible goods and indifferences: The Top Trading Absorbing Sets mechanisms," Games and Economic Behavior, Elsevier, vol. 73(1), pages 1-16, September.
    20. Marek Pycia & M. Utku Ünver, 2021. "Arrovian Efficiency and Auditability in Discrete Mechanism Design," Boston College Working Papers in Economics 1044, Boston College Department of Economics.

    More about this item

    Keywords

    Top Trading Cycles; Characterization; Strategy-proofness; Object; Matching;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
    • D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement

    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:eee:ecolet:v:233:y:2023:i:c:s0165176523004093. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ecolet .

    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.