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

Royal Processions: Incentives, Efficiency and Fairness in Two-sided Matching

Author

Listed:
  • Sophie Bade
  • Joseph Root

Abstract

We study the set of incentive compatible and efficient two-sided matching mechanisms. We classify all such mechanisms under an additional assumption -- "gender-neutrality" -- which guarantees that the two sides be treated symmetrically. All group strategy-proof, efficient and gender-neutral mechanisms are recursive and the outcome is decided in a sequence of rounds. In each round, two agents are selected, one from each side. These agents are either "matched-by-default" or "unmatched-by-default." In the former case either of the selected agents can unilaterally force the other to match with them while in the latter case they may only match together if both agree. In either case, if this pair of agents is not matched together, each gets their top choice among the set of remaining agents. As an important step in the characterization, we first show that in one-sided matching all group strategy-proof and efficient mechanisms are sequential dictatorships. An immediate corollary is that there are no individually rational, group strategy-proof and efficient one-sided matching mechanisms.

Suggested Citation

  • Sophie Bade & Joseph Root, 2023. "Royal Processions: Incentives, Efficiency and Fairness in Two-sided Matching," Papers 2301.13037, arXiv.org.
    • Handle: RePEc:arx:papers:2301.13037
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Joseph Root & David S. Ahn, 2020. "Incentives and Efficiency in Constrained Allocation Mechanisms," Papers 2006.06776, arXiv.org, revised Nov 2023.
    2. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    3. Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
    4. Federico Echenique & Joseph Root & Fedor Sandomirskiy, 2022. "Efficiency in Random Resource Allocation and Social Choice," Papers 2203.06353, arXiv.org, revised Aug 2022.
    5. Sophie Bade, 2020. "Random Serial Dictatorship: The One and Only," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 353-368, February.
    6. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    7. 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)

    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. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    2. X. Ruiz del Portal, 2012. "Conditions for incentive compatibility in models with multidimensional allocation functions and one-dimensional types," Review of Economic Design, Springer;Society for Economic Design, vol. 16(4), pages 311-321, December.
    3. Marek Pycia & M. Utku Ünver, 2021. "Arrovian Efficiency and Auditability in Discrete Mechanism Design," Boston College Working Papers in Economics 1044, Boston College Department of Economics.
    4. José Alcalde & Antonio Romero-Medina, 2017. "Fair student placement," Theory and Decision, Springer, vol. 83(2), pages 293-307, August.
    5. Pycia, Marek & Ãœnver, M. Utku, 2020. "Arrovian Efficiency and Auditability in the Allocation of Discrete Resources," CEPR Discussion Papers 15377, C.E.P.R. Discussion Papers.
    6. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    7. Marek Pycia & M. Utku Ünver, 2022. "Outside options in neutral allocation of discrete resources," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 581-604, December.
    8. Che, Yeon-Koo & Kim, Jinwoo & Kojima, Fuhito, 2015. "Efficient assignment with interdependent values," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 54-86.
    9. 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.
    10. Felix Brandt & Patrick Lederer & René Romen, 2024. "Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(1), pages 19-55, August.
    11. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    12. Brandt, Felix & Saile, Christian & Stricker, Christian, 2022. "Strategyproof social choice when preferences and outcomes may contain ties," Journal of Economic Theory, Elsevier, vol. 202(C).
    13. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
    14. Katharina Huesmann & Achim Wambach, 2015. "Constraints on Matching Markets Based on Moral Concerns," CESifo Working Paper Series 5356, CESifo.
    15. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
    16. Sonmez, Tayfun, 1996. "Implementation in generalized matching problems," Journal of Mathematical Economics, Elsevier, vol. 26(4), pages 429-439.
    17. Alcalde, Jose & Revilla, Pablo, 2004. "Researching with whom? Stability and manipulation," Journal of Mathematical Economics, Elsevier, vol. 40(8), pages 869-887, December.
    18. Pycia, Marek & Ünver, M. Utku, 2015. "Decomposing random mechanisms," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 21-33.
    19. 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.
    20. Liu, Peng, 2020. "Local vs. global strategy-proofness: A new equivalence result for ordinal mechanisms," Economics Letters, Elsevier, vol. 189(C).

    More about this item

    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:arx:papers:2301.13037. 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.