IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2306.17773.html
   My bibliography  Save this paper

Obvious Manipulations in Matching without and with Contracts

Author

Listed:
  • R. Pablo Arribillaga
  • E. Pepa Risma

Abstract

This paper explores many-to-one matching models, both with and without contracts, where doctors' preferences are private and hospitals' preferences are public and substitutable. It is known that any stable-dominating mechanism --which is either stable or individually rational and Pareto-dominates (from the doctors' perspective) a stable mechanism--, is susceptible to manipulation by doctors. Our study focuses on \textit{obvious manipulations} and identifies stable-dominating mechanisms that prevent them. Without contracts, we show that more efficient mechanisms are less likely to be obviously manipulable and that any stable-dominating mechanism is not obviously manipulable. However, with contracts, none of these results hold. While we demonstrate that the Doctor-Proposing Deferred Acceptance (DA) Mechanism remains not obviously manipulable, we show that the Hospital-Proposing DA Mechanism and any efficient mechanism that Pareto-dominates the Doctor-Proposing DA Mechanism become (very) obviously manipulable, in the model with contracts.

Suggested Citation

  • R. Pablo Arribillaga & E. Pepa Risma, 2023. "Obvious Manipulations in Matching without and with Contracts," Papers 2306.17773, arXiv.org, revised Oct 2024.
    • Handle: RePEc:arx:papers:2306.17773
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2306.17773
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    2. 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.
    3. 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.
    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. 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. Pablo R. Arribillaga & Agustin G. Bonifacio, 2023. "Not Obviously Manipulable Allotment Rules," Working Papers 284, Red Nacional de Investigadores en Economía (RedNIE).
    2. 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.

    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. 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).
    2. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    3. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Braun, Sebastian & Dwenger, Nadja & Kübler, Dorothea & Westkamp, Alexander, 2014. "Implementing quotas in university admissions: An experimental analysis," Games and Economic Behavior, Elsevier, vol. 85(C), pages 232-251.
    11. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Boston College Working Papers in Economics 639, Boston College Department of Economics.
    12. 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.
    13. Juárez, Noelia & Neme, Pablo & Oviedo, Jorge, 2022. "Lattice structure of the random stable set in many-to-many matching markets," Games and Economic Behavior, Elsevier, vol. 132(C), pages 255-273.
    14. Abdulkadiroglu, Atila & Andersson, Tommy, 2022. "School Choice," Working Papers 2022:4, Lund University, Department of Economics.
    15. 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.
    16. 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.
    17. Oğuz Afacan, Mustafa, 2012. "Group robust stability in matching markets," Games and Economic Behavior, Elsevier, vol. 74(1), pages 394-398.
    18. Hatfield, John William & Kojima, Fuhito & Narita, Yusuke, 2016. "Improving schools through school choice: A market design approach," Journal of Economic Theory, Elsevier, vol. 166(C), pages 186-211.
    19. Lars Ehlers & Bettina Klaus, 2014. "Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 949-966, November.
    20. Kamada, Yuichiro & Kojima, Fuhito, 2017. "Stability concepts in matching under distributional constraints," Journal of Economic Theory, Elsevier, vol. 168(C), pages 107-142.

    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:arx:papers:2306.17773. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.