IDEAS home Printed from https://ideas.repec.org/p/edj/ceauch/332.html
   My bibliography  Save this paper

(Group) Strategy-proofness and stability in many-to many marching markets

Author

Listed:
  • Antonio Romero-Medina
  • Matteo Triossi

Abstract

We study strategy-profness in many-to many matching markets. We prove that when firms have acyclical preferences over workers and both firms and workers have responsive preferences, the worker-optimal stable mechanism is group strategy-proof and Pareto optimal. Absent any assumption on workers’ references, an Adjusted Serial Dictatorship among workers is stable, group strategy-proof and Pareto optimal for workers. In both cases, the set of stable matchings is a singleton. We show that acyclicity is the minimal condition guaranteeing the existence of stable and strategy-proof mechanisms in many-to-many matching markets. Economic Literature Classification Numbers: C71, C78, D71, D78. Key words: Keywords: Many-to-many markets, Acyclicity, Stability, Group Strategy-proofness, singleton core.

Suggested Citation

  • Antonio Romero-Medina & Matteo Triossi, 2017. "(Group) Strategy-proofness and stability in many-to many marching markets," Documentos de Trabajo 332, Centro de Economía Aplicada, Universidad de Chile.
    • Handle: RePEc:edj:ceauch:332
    as

    Download full text from publisher

    File URL: http://www.cea-uchile.cl/wp-content/uploads/doctrab/ASOCFILE120170614160341.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lars Ehlers & Bettina Klaus, 2003. "Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 265-280, October.
    2. Onur Kesten, 2012. "On two kinds of manipulation for school choice problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(3), pages 677-693, November.
    3. Caterina Calsamiglia & Guillaume Haeringer & Flip Klijn, 2010. "Constrained School Choice: An Experimental Study," American Economic Review, American Economic Association, vol. 100(4), pages 1860-1874, September.
    4. Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-2271, August.
    5. Roth, Alvin E, 1991. "A Natural Experiment in the Organization of Entry-Level Labor Markets: Regional Markets for New Physicians and Surgeons in the United Kingdom," American Economic Review, American Economic Association, vol. 81(3), pages 415-440, June.
    6. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    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. Schummer, James & Abizada, Azar, 2017. "Incentives in landing slot problems," Journal of Economic Theory, Elsevier, vol. 170(C), pages 29-55.
    9. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
    10. Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
    11. 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.
    12. Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
    Full references (including those not matched with items on IDEAS)

    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. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    2. Antonio Romero-Medina & Matteo Triossi, 2021. "Two-sided strategy-proofness in many-to-many matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 105-118, March.
    3. Romero-Medina, Antonio & Triossi, Matteo, 2018. "Centralized Course Allocation," UC3M Working papers. Economics 27388, Universidad Carlos III de Madrid. Departamento de Economía.
    4. Tayfun Sönmez, 2013. "Bidding for Army Career Specialties: Improving the ROTC Branching Mechanism," Journal of Political Economy, University of Chicago Press, vol. 121(1), pages 186-219.
    5. Romero-Medina, Antonio & Triossi, Matteo, 2024. "Strategic priority-based course allocation," Journal of Economic Behavior & Organization, Elsevier, vol. 226(C).
    6. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202103100800001123, Iowa State University, Department of Economics.
    7. Zhu, Min, 2014. "College admissions in China: A mechanism design perspective," China Economic Review, Elsevier, vol. 30(C), pages 618-631.
    8. John William Hatfield & Fuhito Kojima & Yusuke Narita, 2011. "Promoting School Competition Through School Choice: A Market Design Approach," Working Papers 2011-018, Human Capital and Economic Opportunity Working Group.
    9. Afacan, Mustafa Oğuz & Dur, Umut & Van der Linden, Martin, 2024. "Capacity design in school choice," Games and Economic Behavior, Elsevier, vol. 146(C), pages 277-291.
    10. Orhan Aygun & Bertan Turhan, 2020. "Designing Direct Matching Mechanism for India with Comprehensive Affirmative Action," Papers 2004.13264, arXiv.org, revised Dec 2021.
    11. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-Proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match," American Economic Review, American Economic Association, vol. 99(5), pages 1954-1978, December.
    12. Orhan Aygün & Bertan Turhan, 2023. "How to De-Reserve Reserves: Admissions to Technical Colleges in India," Management Science, INFORMS, vol. 69(10), pages 6147-6164, October.
    13. Fuhito Kojima & M. Utku Ünver, 2010. "The 'Boston' School-Choice Mechanism," Boston College Working Papers in Economics 729, Boston College Department of Economics, revised 08 Oct 2010.
    14. Min Zhu, 2013. "College Admissions in China : A Mechanism Design Perspective," Working Papers halshs-00860931, HAL.
    15. Jaimie W. Lien & Jie Zheng & Xiaohan Zhong, 2016. "Preference submission timing in school choice matching: testing fairness and efficiency in the laboratory," Experimental Economics, Springer;Economic Science Association, vol. 19(1), pages 116-150, March.
    16. Chen, Yajing & Jiao, Zhenhua & Zhang, Yang & Zhao, Fang, 2021. "Resource allocation on the basis of priorities under multi-unit demand," Economics Letters, Elsevier, vol. 202(C).
    17. Li, Mengling, 2020. "Ties matter: Improving efficiency in course allocation by allowing ties," Journal of Economic Behavior & Organization, Elsevier, vol. 178(C), pages 354-384.
    18. Atila Abdulkadiroglu & Tommy Andersson, 2022. "School Choice," NBER Working Papers 29822, National Bureau of Economic Research, Inc.
    19. Wu, Binzhen & Zhong, Xiaohan, 2020. "Matching inequality and strategic behavior under the Boston mechanism: Evidence from China's college admissions," Games and Economic Behavior, Elsevier, vol. 123(C), pages 1-21.
    20. Min Zhu, 2013. "College Admissions in China : A Mechanism Design Perspective," Working Papers 1327, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:edj:ceauch:332. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/ceuclcl.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.