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

On obviously strategy-proof implementation of fixed priority top trading cycles with outside options

Author

Listed:
  • Mandal, Pinaki
  • Roy, Souvik

Abstract

We study the implementation of a fixed priority top trading cycles (FPTTC) rule via an obviously strategy-proof (OSP) mechanism (Li, 2017) in the context of assignment problems with outside options, where agents are to be assigned at most one indivisible object and monetary transfers are not allowed. In a model without outside options, Troyan (2019) gives a sufficient (but not necessary) and Mandal and Roy (2020) give a necessary and sufficient condition for an FPTTC rule to be OSP-implementable. This paper shows that in a model with outside options, the two conditions (in Troyan (2019) and Mandal and Roy (2020)) are equivalent for an FPTTC rule, and each of them is necessary and sufficient for an FPTTC rule to be OSP-implementable.

Suggested Citation

  • Mandal, Pinaki & Roy, Souvik, 2022. "On obviously strategy-proof implementation of fixed priority top trading cycles with outside options," Economics Letters, Elsevier, vol. 211(C).
    • Handle: RePEc:eee:ecolet:v:211:y:2022:i:c:s0165176521004754
    DOI: 10.1016/j.econlet.2021.110239
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176521004754
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econlet.2021.110239?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. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2020. "On obvious strategy-proofness and single-peakedness," Journal of Economic Theory, Elsevier, vol. 186(C).
    2. Ashlagi, Itai & Gonczarowski, Yannai A., 2018. "Stable matching mechanisms are not obviously strategy-proof," Journal of Economic Theory, Elsevier, vol. 177(C), pages 405-425.
    3. Bade, Sophie, 2019. "Matching with single-peaked preferences," Journal of Economic Theory, Elsevier, vol. 180(C), pages 81-99.
    4. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    5. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    6. Mandal, Pinaki & Roy, Souvik, 2020. "Obviously Strategy-proof Implementation of Assignment Rules: A New Characterization," MPRA Paper 104044, University Library of Munich, Germany.
    7. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    8. Peter Troyan, 2019. "Obviously Strategy‐Proof Implementation Of Top Trading Cycles," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 60(3), pages 1249-1261, August.
    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. Markus Möller, 2024. "Transparent Matching Mechanisms," ECONtribute Discussion Papers Series 306, University of Bonn and University of Cologne, Germany.
    2. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.

    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. Shengwu Li, 2024. "Designing Simple Mechanisms," Papers 2403.18694, arXiv.org, revised Jul 2024.
    2. Louis Golowich & Shengwu Li, 2021. "On the Computational Properties of Obviously Strategy-Proof Mechanisms," Papers 2101.05149, arXiv.org, revised Oct 2022.
    3. Clayton Thomas, 2020. "Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof," Papers 2011.12367, arXiv.org, revised Feb 2021.
    4. Pablo R. Arribillaga & Jordi Massó & Alejandro Neme, 2023. "Obvious Strategy-proofness with Respect to a Partition," Working Papers 293, Red Nacional de Investigadores en Economía (RedNIE).
    5. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    6. Yannai A. Gonczarowski & Ori Heffetz & Clayton Thomas, 2022. "Strategyproofness-Exposing Mechanism Descriptions," Papers 2209.13148, arXiv.org, revised Jul 2023.
    7. Tamura, Yuki, 2023. "Object reallocation problems with single-dipped preferences," Games and Economic Behavior, Elsevier, vol. 140(C), pages 181-196.
    8. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    9. Mandal, Pinaki & Roy, Souvik, 2020. "Obviously Strategy-proof Implementation of Assignment Rules: A New Characterization," MPRA Paper 104044, University Library of Munich, Germany.
    10. Mariya Halushka, 2021. "Obviously Strategy-proof Mechanism Design With Rich Private Information," Working Papers 2104E, University of Ottawa, Department of Economics.
    11. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    12. Markus Möller, 2024. "Transparent Matching Mechanisms," ECONtribute Discussion Papers Series 306, University of Bonn and University of Cologne, Germany.
    13. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2023. "All sequential allotment rules are obviously strategy-proof," Theoretical Economics, Econometric Society, vol. 18(3), July.
    14. Andrew Komo & Scott Duke Kominers & Tim Roughgarden, 2024. "Shill-Proof Auctions," Papers 2404.00475, arXiv.org.
    15. Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.
    16. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    17. Soo Hong Chew & Wenqian Wang, 2022. "Information Design of Dynamic Mechanisms," Papers 2205.10844, arXiv.org.
    18. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2020. "On obvious strategy-proofness and single-peakedness," Journal of Economic Theory, Elsevier, vol. 186(C).
    19. Yannai A. Gonczarowski & Ori Heffetz & Guy Ishai & Clayton Thomas, 2024. "Describing Deferred Acceptance and Strategyproofness to Participants: Experimental Analysis," Papers 2409.18166, arXiv.org.
    20. Jiangtao Li & Piotr Dworczak, 2020. "Are simple mechanisms optimal when agents are unsophisticated?," GRAPE Working Papers 42, GRAPE Group for Research in Applied Economics.

    More about this item

    Keywords

    Fixed priority top trading cycles; Obvious strategy-proofness; Indivisible goods; Outside options;
    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

    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:211:y:2022:i:c:s0165176521004754. 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.