Research Of Marriage Matching Problem Based On Multiple-A Ttribute Two-sided Matching Model

There are so many men and women who cannot get married and the imbalance of the proportion of the population is increasing,which means that the marriage problem has become a social problem that needs to be solved in today's society.In real life,all involved in two groups of different stakeholders,each subject as much as possible to match the other side,and make the two sides the greatest satisfaction,all belong to the two-sided matching problem.The marriage of man and woman is a two-sided matching problem.The ordinal information of satisfaction using in the marriage matching cannot measure the intensity of the preferences,and the classic Gale-Shapley algorithm can get one-sided optimal matching result only,i.e.man-optimal or woman-optimal.According to the above defects,this paper firstly provides two cardinal satisfaction evaluation models for male and female respectively by analyzing the member data from an online dating website.Then,a linear programming model and its solution are given to solve the two-sided matching problem that is based on the cardinal satisfaction.We also want to find out the optimal matching amount for intermediary considering the dynamic two-sided matching,since the trade-off between matching satisfaction and waiting time of customers.A mathematical model is developed to maximize satisfaction and minimize waiting time while its simulation results examine the model effective.There is numerical example be presented to illustrate the feasibility and validity of the two models.Our research enriches and develops the two-sided matching model,and can be applied to other related matching problems.