Stable Two-Sided Matching Decision Making Method with One-Side Reciprocal Preferences
KONG Decai1,2 ,CUI Jie1,2, LIU Changping1,2
Author information+
1. School of Management Engineering, Huaiyin Institute of Technology, Huai’an 223003;
2. Jiangsu Smart Factory Engineering Research Center, Huai’an 223003
A stable matching decision method is proposed
to solve the two-sided matching problem that one side agents give
the preference order information, and the other agents generates
the reciprocal preferences. Firstly, the two-sided matching problem
with one-sided reciprocal preferences is described. Then, the concepts,
such as one-sided reciprocal stable matching and Pareto effective
matching, are defined and the existence of one-sided stable matching
scheme is proved by the extended Gale-Shapley algorithm. Furthermore,
the stable matching optimization model maximizing two-sided matching
agents' satisfaction degree is constructed. The analysis of the
characteristics of the model shows that the matching solution
corresponding to the optimal solution of the model is a Pareto
effective matching schema. Finally, the method proposed in this
paper is used to recommend suitable couples for men and women.
KONG Decai, CUI Jie, LIU Changping.
Stable Two-Sided Matching Decision Making Method with One-Side Reciprocal Preferences. Journal of Systems Science and Mathematical Sciences, 2021, 41(4): 1108-1120 https://doi.org/10.12341/jssms20226