IDEAS home Printed from https://ideas.repec.org/p/aoz/wpaper/257.html
   My bibliography  Save this paper

Obvious Manipulations in Matching with and without Contracts

Author

Listed:
  • Pablo R. Arribillaga

    (UNSL/CONICET)

  • Eliana Pepa Risma

    (UNSL/CONICET)

Abstract

In a many-to-one matching model, with or without contracts, where doctors’ preferences are private information and hospitals’ preferences are substitutable and public information, any stable matching rule could be manipulated for doctors. Since manipulations can not be completely avoided, we consider the concept of obvious manipulations and look for stable matching rules that prevent at least such manipulations (for doctors). For the model with contracts, we prove that: (i) the doctor-optimal matching rule is non-obviously manipulable and (ii) the hospital-optimal matching rule is obviously manipulable, even in the one-to-one model. In contrast to (ii), for a many-to-one model without contracts, we prove that the hospital-optimal matching rule is not obviously manipulable.Furthermore, if we focus on quantile stable rules, then we prove that the doctor-optimal matching rule is the only non-obviously manipulable quantile stable rule

Suggested Citation

  • Pablo R. Arribillaga & Eliana Pepa Risma, 2023. "Obvious Manipulations in Matching with and without Contracts," Working Papers 257, Red Nacional de Investigadores en Economía (RedNIE).
  • Handle: RePEc:aoz:wpaper:257
    as

    Download full text from publisher

    File URL: https://rednie.eco.unc.edu.ar/files/DT/257.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Troyan, Peter & Morrill, Thayer, 2020. "Obvious manipulations," Journal of Economic Theory, Elsevier, vol. 185(C).
    2. Ruth Martínez & Jordi Massó & Alejdanro Neme & Jorge Oviedo, 2004. "On group strategy-proof mechanisms for a many-to-one matching model," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(1), pages 115-128, January.
    3. Josué Ortega & Erel Segal-Halevi, 2022. "Obvious manipulations in cake-cutting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(4), pages 969-988, November.
    4. Pepa Risma, Eliana, 2015. "Binary operations and lattice structure for a model of matching with contracts," Mathematical Social Sciences, Elsevier, vol. 73(C), pages 6-12.
    5. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    6. Troyan, Peter & Delacrétaz, David & Kloosterman, Andrew, 2020. "Essentially stable matchings," Games and Economic Behavior, Elsevier, vol. 120(C), pages 370-390.
    7. Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
    8. Fernandez, Marcelo Ariel, 2018. "Deferred acceptance and regret-free truth-telling," Economics Working Paper Archive 65832, The Johns Hopkins University,Department of Economics, revised 31 Jul 2020.
    9. Alvin E. Roth, 1982. "The Economics of Matching: Stability and Incentives," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 617-628, November.
    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. SHINOZAKI, Hiroki, 2023. "Non-obvious manipulability and efficiency in package assignment problems with money for agents with income effects and hard budget constraints," Discussion paper series HIAS-E-136, Hitotsubashi Institute for Advanced Study, Hitotsubashi University.
    2. R. Pablo Arribillaga & Agustin G. Bonifacio, 2023. "Not obviously manipulable allotment rules," Papers 2309.06546, 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. Hatfield, John William & Kojima, Fuhito, 2009. "Group incentive compatibility for matching with contracts," Games and Economic Behavior, Elsevier, vol. 67(2), pages 745-749, November.
    2. Bando, Keisuke, 2014. "On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm," Games and Economic Behavior, Elsevier, vol. 87(C), pages 269-287.
    3. Jiao, Zhenhua & Tian, Guoqiang & Chen, Songqing & Yang, Fei, 2016. "The blocking lemma and group incentive compatibility for matching with contracts," Mathematical Social Sciences, Elsevier, vol. 82(C), pages 65-71.
    4. Oğuz Afacan, Mustafa, 2012. "Group robust stability in matching markets," Games and Economic Behavior, Elsevier, vol. 74(1), pages 394-398.
    5. Yuichiro Kamada & Fuhito Kojima, 2020. "Accommodating various policy goals in matching with constraints," The Japanese Economic Review, Springer, vol. 71(1), pages 101-133, January.
    6. Paola B. Manasero & Jorge Oviedo, 2022. "General Manipulability Theorem for a Matching Model," Papers 2210.06549, arXiv.org.
    7. Jiao, Zhenhua & Tian, Guoqiang, 2017. "The Blocking Lemma and strategy-proofness in many-to-many matchings," Games and Economic Behavior, Elsevier, vol. 102(C), pages 44-55.
    8. Ehlers, Lars & Hafalir, Isa E. & Yenmez, M. Bumin & Yildirim, Muhammed A., 2014. "School choice with controlled choice constraints: Hard bounds versus soft bounds," Journal of Economic Theory, Elsevier, vol. 153(C), pages 648-683.
    9. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    10. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    11. Hatfield, John William & Kojima, Fuhito, 2010. "Substitutes and stability for matching with contracts," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1704-1723, September.
    12. Konishi, Hideo & Unver, M. Utku, 2006. "Credible group stability in many-to-many matching problems," Journal of Economic Theory, Elsevier, vol. 129(1), pages 57-80, July.
    13. Diss, Mostapha & Doghmi, Ahmed & Tlidi, Abdelmonaim, 2016. "Strategy proofness and unanimity in many-to-one matching markets," MPRA Paper 75927, University Library of Munich, Germany, revised 08 Dec 2016.
    14. Alcalde, José, 2018. "Beyond the Spanish MIR with consent: (Hidden) cooperation and coordination in matching," Games and Economic Behavior, Elsevier, vol. 110(C), pages 32-49.
    15. Noelia Juarez & Paola B. Manasero & Jorge Oviedo, 2023. "Nash implementation in a many-to-one matching market," Papers 2305.13956, arXiv.org, revised Apr 2024.
    16. Fuhito Kojima & Parag A. Pathak, 2009. "Incentives and Stability in Large Two-Sided Matching Markets," American Economic Review, American Economic Association, vol. 99(3), pages 608-627, June.
    17. Klijn, Flip & Yazıcı, Ayşe, 2014. "A many-to-many ‘rural hospital theorem’," Journal of Mathematical Economics, Elsevier, vol. 54(C), pages 63-73.
    18. Kojima, Fuhito, 2008. "The law of aggregate demand and welfare in the two-sided matching market," Economics Letters, Elsevier, vol. 99(3), pages 581-584, June.
    19. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Levine's Bibliography 122247000000001022, UCLA Department of Economics.
    20. Claus-Jochen Haake & Bettina Klaus, 2009. "Monotonicity and Nash implementation in matching markets with contracts," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 41(3), pages 393-410, December.

    More about this item

    Keywords

    obvious manipulations; matching; contracts;
    All these keywords.

    JEL classification:

    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • D72 - Microeconomics - - Analysis of Collective Decision-Making - - - Political Processes: Rent-seeking, Lobbying, Elections, Legislatures, and Voting Behavior

    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:aoz:wpaper:257. 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: Laura Inés D Amato (email available below). General contact details of provider: https://edirc.repec.org/data/redniar.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.