IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2409.06865.html

Speeding up deferred acceptance

Author

Listed:
  • Gregory Z. Gutin
  • Daniel Karapetyan
  • Philip R. Neary
  • Alexander Vickery
  • Anders Yeo

Abstract

A run of the deferred acceptance (DA) algorithm may contain proposals that are sure to be rejected. We introduce the accelerated deferred acceptance algorithm that proceeds in a similar manner to DA but with sure-to-be rejected proposals ruled out. Accelerated deferred acceptance outputs the same stable matching as DA but does so more efficiently: it terminates in weakly fewer rounds, requires weakly fewer proposals, and final pairs match no later. Computational experiments show that these efficiency savings can be strict.

Suggested Citation

  • Gregory Z. Gutin & Daniel Karapetyan & Philip R. Neary & Alexander Vickery & Anders Yeo, 2024. "Speeding up deferred acceptance," Papers 2409.06865, arXiv.org.
    • Handle: RePEc:arx:papers:2409.06865
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Stahl, Dale II & Wilson, Paul W., 1994. "Experimental evidence on players' models of other players," Journal of Economic Behavior & Organization, Elsevier, vol. 25(3), pages 309-327, December.
    2. Eeckhout, Jan, 1999. "Bilateral Search and Vertical Heterogeneity," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 40(4), pages 869-887, November.
    3. Stahl Dale O. & Wilson Paul W., 1995. "On Players' Models of Other Players: Theory and Experimental Evidence," Games and Economic Behavior, Elsevier, vol. 10(1), pages 218-254, July.
    4. Bó, Inácio & Hakimov, Rustamdjan, 2022. "The iterative deferred acceptance mechanism," Games and Economic Behavior, Elsevier, vol. 135(C), pages 411-433.
    5. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    6. Doval, Laura, 2022. "Dynamically stable matching," Theoretical Economics, Econometric Society, vol. 17(2), May.
    7. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    8. Crawford, Vincent P & Knoer, Elsie Marie, 1981. "Job Matching with Heterogeneous Firms and Workers," Econometrica, Econometric Society, vol. 49(2), pages 437-450, March.
    9. Alvin E. Roth, 1982. "The Economics of Matching: Stability and Incentives," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 617-628, November.
    10. Gutin, Gregory Z. & Neary, Philip R. & Yeo, Anders, 2024. "Finding all stable matchings with assignment constraints," Games and Economic Behavior, Elsevier, vol. 148(C), pages 244-263.
    11. Gregory Gutin & Philip R. Neary & Anders Yeo, 2022. "Finding all stable matchings with assignment constraints," Papers 2204.03989, arXiv.org, revised Jun 2024.
    12. Mohammad Akbarpour & Shengwu Li & Shayan Oveis Gharan, 2020. "Thickness and Information in Dynamic Matching Markets," Journal of Political Economy, University of Chicago Press, vol. 128(3), pages 783-815.
    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. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    2. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    3. Battal Doğan & M. Bumin Yenmez, 2023. "When does an additional stage improve welfare in centralized assignment?," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(4), pages 1145-1173, November.
    4. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    5. Muriel Niederle & Alvin E. Roth, 2009. "The Effects of a Centralized Clearinghouse on Job Placement, Wages, and Hiring Practices," NBER Chapters, in: Studies of Labor Market Intermediation, pages 235-271, National Bureau of Economic Research, Inc.
    6. Biermann, Florian M. & Naroditskiy, Victor & Polukarov, Maria & Nguyen, Tri-Dung & Rogers, Alex & Jennings, Nicholas R., 2014. "Task assignment with controlled and autonomous agents," Mathematical Social Sciences, Elsevier, vol. 71(C), pages 116-121.
    7. Roth, Alvin E., 1985. "Common and conflicting interests in two-sided matching markets," European Economic Review, Elsevier, vol. 27(1), pages 75-96, February.
    8. Dutta, Bhaskar & Masso, Jordi, 1997. "Stability of Matchings When Individuals Have Preferences over Colleagues," Journal of Economic Theory, Elsevier, vol. 75(2), pages 464-475, August.
    9. Yasushi Kawase & Keisuke Bando, 2021. "Subgame perfect equilibria under the deferred acceptance algorithm," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 503-546, June.
    10. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    11. 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.
    12. Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2018. "Designing matching mechanisms under constraints: An approach from discrete convex analysis," Journal of Economic Theory, Elsevier, vol. 176(C), pages 803-833.
    13. Alexander Westkamp, 2013. "An analysis of the German university admissions system," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(3), pages 561-589, August.
    14. Jalota, Devansh & Ostrovsky, Michael & Pavone, Marco, 2025. "Matching with transfers under distributional constraints," Games and Economic Behavior, Elsevier, vol. 152(C), pages 313-332.
    15. Schwarz, Michael & Yenmez, M. Bumin, 2011. "Median stable matching for markets with wages," Journal of Economic Theory, Elsevier, vol. 146(2), pages 619-637, March.
    16. Ma, Jinpeng, 2010. "The singleton core in the college admissions problem and its application to the National Resident Matching Program (NRMP)," Games and Economic Behavior, Elsevier, vol. 69(1), pages 150-164, May.
    17. Muriel Niederle & Leeat Yariv, 2009. "Decentralized Matching with Aligned Preferences," NBER Working Papers 14840, National Bureau of Economic Research, Inc.
    18. Perez-Castrillo, David & Sotomayor, Marilda, 2002. "A Simple Selling and Buying Procedure," Journal of Economic Theory, Elsevier, vol. 103(2), pages 461-474, April.
    19. Arnaud Dupuy & Alfred Galichon & Sonia Jaffe & Scott Duke Kominers, 2020. "Taxation In Matching Markets," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 61(4), pages 1591-1634, November.
    20. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(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:2409.06865. 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.