Improving the deferred acceptance algorithm for efficient sponsor-recipient matching

Abstract

As the gap between rich and poor in China has become increasingly prominent, various charity platforms have emerged. However, due to information asymmetry, many recipients cannot receive effective donations, and the emergence of fraudulent donations also makes donors unable to fulfill their intentions. We designed some improvements to the delayed acceptance (DA) algorithm and applied it flexibly in the donation platform. This can improve the efficiency of matching between donors and recipients. The variant of the DA algorithm is designed to carry out multiple rounds of matching, give donors and recipients the opportunity to select the matching priority list based on various factors and use a reasonable matching mechanism to achieve Pareto efficient, strategy-proof, and stable matching. Therefore, the application of the variation of the DA algorithm in the donation problem can better match the needs, so that the platform can complete a more reasonable and efficient donation matching.