Research Article
Open access
Published on 12 October 2024
Download pdf
Guo,Y. (2024). Improving the deferred acceptance algorithm for efficient sponsor-recipient matching. Applied and Computational Engineering,90,40-46.
Export citation

Improving the deferred acceptance algorithm for efficient sponsor-recipient matching

Yiqi Guo *,1,
  • 1 Beijing National Day School

* Author to whom correspondence should be addressed.

https://doi.org/10.54254/2755-2721/90/20241755

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.

Keywords

Deferred Acceptance Algorithm, Donation Matching, Charity Platforms, Information Asymmetry, Pareto Efficiency

[1]. Ye, Xingqing, and Haodong Yin. “Research Result.” From Absolute Poverty Eradication to Relative Poverty Alleviation: China’s Poverty Reduction Process and Post-2020 Poverty Reduction Strategy - Academic Articles - China Institute of Poverty Alleviation, Renmin University of Chinese, capri.ruc.edu.cn/yjcg/xslw/dc54a8c426c04631a89cd5d14084f92f.htm. Accessed 22 May 2024.

[2]. Lin, Wenyi. “Social Capital and individual charitable behaviours in China.” Applied Research in Quality of Life, vol. 16, no. 1, 29 July 2019, pp. 141–152, https://doi.org/10.1007/s11482-019-09760-x.

[3]. GALE, D., and L.S. SHAPLEY. College Admissions and the Stability of Marriage, 30 Sept. 1961, https://doi.org/10.21236/ad0251958.

[4]. Green, Corliss L., and Deborah J. Webb. “Factors influencing monetary donations to charitable organizations.” Journal of Nonprofit & Public Sector Marketing, vol. 5, no. 3, 6 Oct. 1997, pp. 19–40, https://doi.org/10.1300/j054v05n03_03.

[5]. Teo, Chung-Piaw, et al. “Gale-Shapley Stable Marriage Problem Revisited: Strategic issues and applications.” Management Science, vol. 47, no. 9, Sept. 2001, pp. 1252–1267, https://doi.org/10.1287/mnsc.47.9.1252.9784.

Cite this article

Guo,Y. (2024). Improving the deferred acceptance algorithm for efficient sponsor-recipient matching. Applied and Computational Engineering,90,40-46.

Data availability

The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.

Disclaimer/Publisher's Note

The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

About volume

Volume title: Proceedings of the 6th International Conference on Computing and Data Science

Conference website: https://2024.confcds.org/
ISBN:978-1-83558-609-9(Print) / 978-1-83558-610-5(Online)
Conference date: 12 September 2024
Editor:Alan Wang, Ammar Alazab
Series: Applied and Computational Engineering
Volume number: Vol.90
ISSN:2755-2721(Print) / 2755-273X(Online)

© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license. Authors who publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open access policy for details).