Two-Sided Matching with Strict Order Relations Considering Threshold Values

This paper presents a novel method for solving the two-sided matching problem, where the preferences given by two-sided agents are represented in the format of strict order relations and threshold values. The two-sided matching problem with strict order relations considering threshold values is firstly described. The concept of two-sided matching is also introduced. In order to solve the above two-sided matching problem, the strict order relations are transformed into Borda score matrixes, and the threshold values are transformed into threshold Borda scores. According to the Borda score matrixes and the threshold Borda scores corresponding to the threshold values, the comprehensive Borda score cut matrix can be built. Furthermore, based on the comprehensive Borda score cut matrix, an optimization model is established. The matching alternative can be determined by solving the model. Finally, an example is given to illustrate the use of the proposed method.