Speeding Up Deferred Acceptance

September 2024 ● Gregory Gutin , Daniel Karapetyan , Phillip R Neary , Alexander Vickery & Anders Yeo

Download

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.

Figure 1: The proportion of final pairs matched by round.

citation


            @article{gutin2024speedingdeferredacceptance,
            
              title =
              {Speeding up deferred acceptance},

            archivePrefix  =
              {arXiv},

             eprint =
              {2409.06865},
            primaryClass =
               {econ.TH} ,
            year =
              {2024},
            doi =
              https://doi.org/10.48550/arXiv.2409.06865,
            author =
              {Gregory Z. Gutin and Daniel Karapetyan and Philip R. Neary and Alexander Vickery and Anders Yeo}