IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/104044.html
   My bibliography  Save this paper

Obviously Strategy-proof Implementation of Assignment Rules: A New Characterization

Author

Listed:
  • Mandal, Pinaki
  • Roy, Souvik

Abstract

We consider assignment problems where individuals are to be assigned at most one indivisible object and monetary transfers are not allowed. We provide a characterization of assignment rules that are Pareto efficient, non-bossy, and implementable in obviously strategy-proof (OSP) mechanisms. As corollaries of our result, we obtain a characterization of OSP-implementable fixed priority top trading cycles (FPTTC) rules, hierarchical exchange rules, and trading cycles rules. Troyan (2019) provides a characterization of OSP-implementable FPTTC rules when there are equal number of individuals and objects. Our result generalizes this for arbitrary values of those.

Suggested Citation

  • Mandal, Pinaki & Roy, Souvik, 2020. "Obviously Strategy-proof Implementation of Assignment Rules: A New Characterization," MPRA Paper 104044, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:104044
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/104044/1/MPRA_paper_104044.pdf
    File Function: original version
    Download Restriction: no
    File URL: https://mpra.ub.uni-muenchen.de/108591/1/MPRA_paper_108591.pdf
    File Function: revised version
    Download Restriction: no
    File URL: https://mpra.ub.uni-muenchen.de/108368/1/MPRA_paper_108368.pdf
    File Function: revised version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
    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. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    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. Pycia, Marek & Unver, Utku, 2017. "Incentive compatible allocation and exchange of discrete resources," Theoretical Economics, Econometric Society, vol. 12(1), January.
    6. Mark A. Satterthwaite & Hugo Sonnenschein, 1981. "Strategy-Proof Allocation Mechanisms at Differentiable Points," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 48(4), pages 587-597.
    7. 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.
    8. Avinatan Hassidim & Déborah Marciano & Assaf Romm & Ran I. Shorrer, 2017. "The Mechanism Is Truthful, Why Aren't You?," American Economic Review, American Economic Association, vol. 107(5), pages 220-224, May.
    9. Chen, Yan & Sonmez, Tayfun, 2006. "School choice: an experimental study," Journal of Economic Theory, Elsevier, vol. 127(1), pages 202-231, March.
    10. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    11. Rees-Jones, Alex, 2018. "Suboptimal behavior in strategy-proof mechanisms: Evidence from the residency match," Games and Economic Behavior, Elsevier, vol. 108(C), pages 317-330.
    12. Roth, Alvin E. & Postlewaite, Andrew, 1977. "Weak versus strong domination in a market with indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 4(2), pages 131-137, August.
    13. Avinatan Hassidim & Assaf Romm & Ran I. Shorrer, 2016. ""Strategic" Behavior in a Strategy-Proof Environment," Working Paper 413411, Harvard University OpenScholar.
    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. Mandal, Pinaki & Roy, Souvik, 2021. "Strategy-proof Allocation of Indivisible Goods when Preferences are Single-peaked," MPRA Paper 105320, University Library of Munich, Germany.
    2. 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).
    3. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    4. Louis Golowich & Shengwu Li, 2021. "On the Computational Properties of Obviously Strategy-Proof Mechanisms," Papers 2101.05149, arXiv.org, revised Oct 2022.

    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. Yannai A. Gonczarowski & Ori Heffetz & Clayton Thomas, 2022. "Strategyproofness-Exposing Mechanism Descriptions," Papers 2209.13148, arXiv.org, revised Jul 2023.
    2. Pinaki Mandal, 2022. "Simple dominance of fixed priority top trading cycles," Papers 2204.02154, arXiv.org, revised Feb 2023.
    3. Pinaki Mandal & Souvik Roy, 2022. "Obviously Strategy‐Proof Implementation Of Assignment Rules: A New Characterization," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 63(1), pages 261-290, February.
    4. Pablo Guillen & Róbert F. Veszteg, 2021. "Strategy-proofness in experimental matching markets," Experimental Economics, Springer;Economic Science Association, vol. 24(2), pages 650-668, June.
    5. Markus Möller, 2024. "Transparent Matching Mechanisms," ECONtribute Discussion Papers Series 306, University of Bonn and University of Cologne, Germany.
    6. Zhang, Jun, 2021. "Level-k reasoning in school choice," Games and Economic Behavior, Elsevier, vol. 128(C), pages 1-17.
    7. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    8. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    9. Claudia Cerrone & Yoan Hermstrüwer & Onur Kesten, 2024. "School Choice with Consent: an Experiment," The Economic Journal, Royal Economic Society, vol. 134(661), pages 1760-1805.
    10. André Schmelzer, 2018. "Strategy-Proofness of Stochastic Assignment Mechanisms," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 3(1), pages 17-50, December.
    11. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    12. Avinatan Hassidim & Assaf Romm & Ran I. Shorrer, 2021. "The Limits of Incentives in Economic Matching Procedures," Management Science, INFORMS, vol. 67(2), pages 951-963, February.
    13. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    14. Karakaya, Mehmet & Klaus, Bettina & Schlegel, Jan Christoph, 2019. "Top trading cycles, consistency, and acyclic priorities for house allocation with existing tenants," Journal of Economic Theory, Elsevier, vol. 184(C).
    15. Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.
    16. Vincent Meisner & Jonas von Wangenheim, 2022. "Loss aversion in strategy-proof school-choice mechanisms," Papers 2207.14666, arXiv.org.
    17. Hakimov, Rustamdjan & Kübler, Dorothea, 2021. "Experiments on centralized school choice and college admissions: a survey," EconStor Open Access Articles and Book Chapters, ZBW - Leibniz Information Centre for Economics, vol. 24(2), pages 434-488.
    18. Meisner, Vincent & von Wangenheim, Jonas, 2019. "School Choice and Loss Aversion," Rationality and Competition Discussion Paper Series 208, CRC TRR 190 Rationality and Competition.
    19. Rodrigo A. Velez & Alexander L. Brown, 2019. "Empirical strategy-proofness," Papers 1907.12408, arXiv.org, revised Jul 2020.
    20. Meisner, Vincent & von Wangenheim, Jonas, 2023. "Loss aversion in strategy-proof school-choice mechanisms," Journal of Economic Theory, Elsevier, vol. 207(C).

    More about this item

    Keywords

    Assignment problem; Obvious strategy-proofness; Pareto efficiency; Non-bossiness; Indivisible goods;
    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:pra:mprapa:104044. 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: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.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.