IDEAS home Printed from https://ideas.repec.org/a/wly/iecrev/v63y2022i1p261-290.html
   My bibliography  Save this article

Obviously Strategy‐Proof Implementation Of Assignment Rules: A New Characterization

Author

Listed:
  • Pinaki Mandal
  • Souvik Roy

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, nonbossy, 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 (International Economic Review 60 (2019), 1249–61) 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

  • 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.
    • Handle: RePEc:wly:iecrev:v:63:y:2022:i:1:p:261-290
    DOI: 10.1111/iere.12538
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/iere.12538
    Download Restriction: no
    File URL: https://libkey.io/10.1111/iere.12538?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Marek Pycia & Peter Troyan, 2021. "A theory of simplicity in games and mechanism design," ECON - Working Papers 393, Department of Economics - University of Zurich.
    3. Pycia, Marek & Unver, Utku, 2017. "Incentive compatible allocation and exchange of discrete resources," Theoretical Economics, Econometric Society, vol. 12(1), January.
    4. 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.
    5. 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.
    6. 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.
    7. Chen, Yan & Sonmez, Tayfun, 2006. "School choice: an experimental study," Journal of Economic Theory, Elsevier, vol. 127(1), pages 202-231, March.
    8. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    9. Clayton Thomas, 2020. "Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof," Papers 2011.12367, arXiv.org, revised Feb 2021.
    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. Shengwu Li, 2024. "Designing Simple Mechanisms," Papers 2403.18694, arXiv.org, revised Apr 2024.

    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. Mandal, Pinaki & Roy, Souvik, 2020. "Obviously Strategy-proof Implementation of Assignment Rules: A New Characterization," MPRA Paper 104044, University Library of Munich, Germany.
    2. Yannai A. Gonczarowski & Ori Heffetz & Clayton Thomas, 2022. "Strategyproofness-Exposing Mechanism Descriptions," Papers 2209.13148, arXiv.org, revised Jul 2023.
    3. Pinaki Mandal, 2022. "Simple dominance of fixed priority top trading cycles," Papers 2204.02154, arXiv.org, revised Feb 2023.
    4. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    5. Cerrone, Claudia & Hermstrüwer, Yoan & Kesten, Onur, 2021. "School Choice with Consent: An Experiment," Working Papers 2021-09, University of Sydney, School of Economics, revised Feb 2022.
    6. 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.
    7. Marek Pycia & Peter Troyan, 2021. "A theory of simplicity in games and mechanism design," ECON - Working Papers 393, Department of Economics - University of Zurich.
    8. Zhang, Jun, 2021. "Level-k reasoning in school choice," Games and Economic Behavior, Elsevier, vol. 128(C), pages 1-17.
    9. 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.
    10. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    11. Can, Burak & Pourpouneh, Mohsen & Storcken, Ton, 2017. "Cost of transformation: a measure on matchings," Research Memorandum 015, Maastricht University, Graduate School of Business and Economics (GSBE).
    12. Doğan, Battal & Klaus, Bettina, 2018. "Object allocation via immediate-acceptance: Characterizations and an affirmative action application," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 140-156.
    13. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    14. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    15. 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).
    16. Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.
    17. Vincent Meisner & Jonas von Wangenheim, 2022. "Loss aversion in strategy-proof school-choice mechanisms," Papers 2207.14666, arXiv.org.
    18. Christian Basteck, 2024. "An Axiomatization of the Random Priority Rule," Rationality and Competition Discussion Paper Series 502, CRC TRR 190 Rationality and Competition.
    19. Pycia, Marek & Ãœnver, M. Utku, 2020. "Arrovian Efficiency and Auditability in the Allocation of Discrete Resources," CEPR Discussion Papers 15377, C.E.P.R. Discussion Papers.
    20. Ortega, Josué & Klein, Thilo, 2023. "The cost of strategy-proofness in school choice," Games and Economic Behavior, Elsevier, vol. 141(C), pages 515-528.

    More about this item

    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:wly:iecrev:v:63:y:2022:i:1:p:261-290. 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/deupaus.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.