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. 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.
    4. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(4), pages 691-705, August.
    5. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(1), pages 225-228, February.
    6. 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.
    7. Schummer, James & Abizada, Azar, 2017. "Incentives in landing slot problems," Journal of Economic Theory, Elsevier, vol. 170(C), pages 29-55.
    8. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(5), pages 879-883, October.
    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. 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.
    11. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(2), pages 411-413, April.
    12. 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.
    13. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    14. 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.
    15. 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.
    16. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(6), pages 1195-1198, December.
    17. 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. 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).
    4. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
    5. Caspari, Gian, 2020. "Booster draft mechanism for multi-object assignment," ZEW Discussion Papers 20-074, ZEW - Leibniz Centre for European Economic Research.
    6. Franz Diebold & Haris Aziz & Martin Bichler & Florian Matthes & Alexander Schneider, 2014. "Course Allocation via Stable Matching," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 6(2), pages 97-110, April.
    7. Hoda Atef Yekta & Robert Day, 2020. "Optimization-based Mechanisms for the Course Allocation Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 641-660, July.
    8. Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
    9. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
    10. Jörgen Kratz, 2017. "Overlapping multiple object assignments," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 723-753, March.
    11. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    12. Doğan, Battal, 2016. "Responsive affirmative action in school choice," Journal of Economic Theory, Elsevier, vol. 165(C), pages 69-105.
    13. Biró, Péter & Klijn, Flip & Pápai, Szilvia, 2022. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Games and Economic Behavior, Elsevier, vol. 136(C), pages 428-453.
    14. Antonio Romero‐Medina & Matteo Triossi, 2020. "Strategy‐proof and group strategy‐proof stable mechanisms: An equivalence," International Journal of Economic Theory, The International Society for Economic Theory, vol. 16(3), pages 349-354, September.
    15. Mireille Ducassé & Peggy Cellier, 2016. "Using Bids, Arguments and Preferences in Sensitive Multi-unit Assignments: A p-Equitable Process and a Course Allocation Case Study," Group Decision and Negotiation, Springer, vol. 25(6), pages 1211-1235, November.
    16. Pinaki Mandal, 2022. "Simple dominance of fixed priority top trading cycles," Papers 2204.02154, arXiv.org, revised Feb 2023.
    17. 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.
    18. Martin Bichler & Soeren Merting, 2021. "Randomized Scheduling Mechanisms: Assigning Course Seats in a Fair and Efficient Way," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3540-3559, October.
    19. Jacob Coreno & Ivan Balbuzanov, 2022. "Axiomatic Characterizations of Draft Rules," Papers 2204.08300, arXiv.org, revised Mar 2024.
    20. Eduardo M Azevedo & Eric Budish, 2019. "Strategy-proofness in the Large," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 86(1), pages 81-116.

    More about this item

    Keywords

    keywords: many-to-many markets; acyclicity; stability; group strategy-proofness; singleton core.;
    All these 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.