主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2014, Vol. 22 ›› Issue (4): 112-118.

Previous Articles     Next Articles

Decision Analysis Method for Two-Sided Satisfied Matching Considering Stable Matching Condition

FAN Zhi-ping1, LI Ming-yang1,2, YUE Qi3   

  1. 1. School of Business Administration, Northeastern University, Shenyang 110819, China;
    2. Department of Science, Shenyang University of Chemical Technology, Shenyang 110142, China;
    3. School of Information Management, Jiangxi University of Finance and Economics, Nanchang 330013, China
  • Received:2012-02-15 Revised:2013-01-22 Online:2014-04-20 Published:2014-04-23

Abstract: Two-sided matching problem refers to how to obtain proper matching result from two disjoint sets of agents according to the preference information of each agent for potential partners from the opposite set. It is a research topic with extensive practical backgrounds in the field of economic management and attracts the attention of many scholars. In this paper, a decision analysis method for two-sided satisfied matching considering stable matching condition is proposed to solve the two-sided matching problem, in which the preference ordinal numbers are provided by agents on both sides. Firstly, the related concepts on two-sided matching, stable matching and satisfied matching are given. Then, considering the stable matching condition, a multi-objective two-sided matching optimization model which maximizes the satisfaction degrees of two-sided agents is constructed. Furthermore, the linear weighted method is used to convert the multi-objective optimization model into a single-objective optimization model, and the optimal matching result can be obtained by solving the model. Finally, a numerical example is given to illustrate the practicality and effectiveness of the method proposed in this paper.

Key words: two-sided matching, ordinal number, stable matching, satisfaction degree, satisfied matching, optimization model

CLC Number: