A Method for two-sided Matching Based on Preference Ordinal Information
Yang Liu · Yunchou yu guanli · 2012
A decision-making method is proposed to solve the matching problem which matching preference ordinal information has been given by two-sided matching bodies.Firstly,we construct satisfaction degree fuction,and achieve matching satisfaction degree by calculating matching preference ordinal information.Then,we achieve comprehensive matching satisfaction degree by integrating both-sided matching satisfaction degree,and comprehensive matching satisfaction degree is viewed as the weight between two-sided matching bodies.Furthermore,the problem of two-sided matching based on preference ordinal information is transformed into the problem of weight matching on complete bipartite graph.The optimization model of max-weight matching problem is built to solve the two-sided matching problem,and the optimal two-sided matching result is achieved by solving the optimization model.Finally,an example is given to illustrate the practicality and effectiveness of the proposed method.