IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v118y2025ics0304406825000473.html

Resolute and symmetric mechanisms for two-sided matching problems

Author

Listed:
  • Bubboloni, Daniela
  • Gori, Michele
  • Meo, Claudia

Abstract

We focus on the one-to-one two-sided matching model with two disjoint sets of agents of equal size, where each agent in a set has preferences on the agents in the other set modeled by a linear order. A matching mechanism associates a set of matchings to each preference profile; resoluteness, that is the capability to select a unique matching, and stability are important properties for a matching mechanism. The two versions of the deferred acceptance algorithm are resolute and stable matching mechanisms but they are unfair since they strongly favor one side of the market. We introduce a property for matching mechanisms that relates to fairness; such property, called symmetry, captures different levels of fairness and generalizes existing notions. We provide several possibility and impossibility results mainly involving the most general notion of symmetry, known as gender fairness, resoluteness, stability, weak Pareto optimality and minimal optimality. In particular, we prove that: resolute, gender fair matching mechanisms exist if and only if each side of the market consists of an odd number of agents; there exists no resolute, gender fair, minimally optimal matching mechanism. Those results are obtained by employing algebraic methods based on group theory, an approach not yet explored in matching theory.

Suggested Citation

  • Bubboloni, Daniela & Gori, Michele & Meo, Claudia, 2025. "Resolute and symmetric mechanisms for two-sided matching problems," Journal of Mathematical Economics, Elsevier, vol. 118(C).
    • Handle: RePEc:eee:mateco:v:118:y:2025:i:c:s0304406825000473
    DOI: 10.1016/j.jmateco.2025.103130
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406825000473
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2025.103130?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Michele Gori, 2014. "Selecting anonymous, neutral and reversal symmetric minimal majority rules," Working Papers - Mathematical Economics 2014-04, Universita' degli Studi di Firenze, Dipartimento di Scienze per l'Economia e l'Impresa.
    2. Laurent Bartholdi & Wade Hann‐Caruthers & Maya Josyula & Omer Tamuz & Leeat Yariv, 2021. "Equitable Voting Rules," Econometrica, Econometric Society, vol. 89(2), pages 563-589, March.
    3. 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.
    4. Daniela Bubboloni & Michele Gori, 2021. "Breaking ties in collective decision-making," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 44(1), pages 411-457, June.
    5. Nizamogullari, Duygu & Özkal-Sanver, İpek, 2014. "Characterization of the core in full domain marriage problems," Mathematical Social Sciences, Elsevier, vol. 69(C), pages 34-42.
    6. Onur Doğan & Ayça Ebru Giritligil, 2015. "Anonymous and Neutral Social Choice:Existence Results on Resoluteness," Working Papers 201501, Murat Sertel Center for Advanced Economic Studies, Istanbul Bilgi University.
    7. Bubboloni, Daniela & Gori, Michele, 2015. "Symmetric majority rules," Mathematical Social Sciences, Elsevier, vol. 76(C), pages 73-86.
    8. Kivinen, Steven, 2024. "Equitable, neutral, and efficient voting rules," Journal of Mathematical Economics, Elsevier, vol. 115(C).
    9. Daniela Bubboloni & Michele Gori, 2014. "Anonymous and neutral majority rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(2), pages 377-401, August.
    10. Miyagawa, Eiichi, 2002. "Strategy-Proofness and the Core in House Allocation Problems," Games and Economic Behavior, Elsevier, vol. 38(2), pages 347-361, February.
    11. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
    12. Bubboloni, Daniela & Gori, Michele, 2016. "Resolute refinements of social choice correspondences," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 37-49.
    13. Sasaki, Hiroo & Toda, Manabu, 1992. "Consistency and characterization of the core of two-sided matching problems," Journal of Economic Theory, Elsevier, vol. 56(1), pages 218-227, February.
    14. Kivinen, Steven, 2023. "On the manipulability of equitable voting rules," Games and Economic Behavior, Elsevier, vol. 141(C), pages 286-302.
    15. 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.
    16. Bettina Klaus & Flip Klijn, 2006. "Procedurally fair and stable matching," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 27(2), pages 431-447, 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. Daniela Bubboloni & Michele Gori & Claudia Meo, 2024. "Resolute and symmetric mechanisms for two-sided matching problems," Papers 2404.01404, arXiv.org, revised Nov 2024.
    2. Lirong Xia, 2022. "Most Equitable Voting Rules," Papers 2205.14838, arXiv.org, revised Jul 2023.
    3. Josep Freixas & Dani Samaniego, 2026. "On the enumeration of resolute majority rules," Journal of Combinatorial Optimization, Springer, vol. 51(2), pages 1-28, March.
    4. Ali I. Ozkes & M. Remzi Sanver, 2021. "Anonymous, neutral, and resolute social choice revisited," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 97-113, July.
    5. Daniela Bubboloni & Michele Gori, 2021. "Breaking ties in collective decision-making," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 44(1), pages 411-457, June.
    6. Lirong Xia, 2024. "Computing Most Equitable Voting Rules," Papers 2410.04179, arXiv.org.
    7. Bubboloni, Daniela & Gori, Michele, 2016. "On the reversal bias of the Minimax social choice correspondence," Mathematical Social Sciences, Elsevier, vol. 81(C), pages 53-61.
    8. Bubboloni, Daniela & Nardi, Francesco, 2024. "Symmetry groups for social preference functions," Mathematical Social Sciences, Elsevier, vol. 132(C), pages 1-14.
    9. Bubboloni, Daniela & Gori, Michele, 2016. "Resolute refinements of social choice correspondences," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 37-49.
    10. Frank M. V. Feys, 2026. "An Axiomatic Theory of Tie-Breaking: Impossibility, Characterization, and Decomposition," Papers 2605.22846, arXiv.org.
    11. Hiroki Saitoh, 2022. "Characterization of tie-breaking plurality rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(1), pages 139-173, July.
    12. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    13. Lars Ehlers, 2008. "Truncation Strategies in Matching Markets," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 327-335, May.
    14. Jan Christoph Schlegel, 2016. "Virtual Demand and Stable Mechanisms," Cahiers de Recherches Economiques du Département d'économie 16.11, Université de Lausanne, Faculté des HEC, Département d’économie.
    15. Assaf Romm, 2014. "Implications of capacity reduction and entry in many-to-one stable matching," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(4), pages 851-875, December.
    16. Bettina Klaus & Flip Klijn, 2006. "Median Stable Matching for College Admissions," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(1), pages 1-11, April.
    17. Min Zhu, 2013. "College Admissions in China : A Mechanism Design Perspective," Working Papers 1327, Groupe d'Analyse et de Théorie Economique Lyon St-Etienne (GATE Lyon St-Etienne), Université de Lyon.
    18. Zhu, Min, 2014. "College admissions in China: A mechanism design perspective," China Economic Review, Elsevier, vol. 30(C), pages 618-631.
    19. Takumi Kongo, 2013. "An incompatibility between recursive unanimity and strategy-proofness in two-sided matching problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(2), pages 461-478, February.
    20. EHLERS, Lars, 2010. "School Choice with Control," Cahiers de recherche 2010-05, Universite de Montreal, Departement de sciences economiques.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:mateco:v:118:y:2025:i:c:s0304406825000473. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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.