{"title":"基于异构不完全偏好关系的双边匹配决策","authors":"Zhen Zhang, Xinyue Kou, W. Yu","doi":"10.1109/ISKE.2017.8258739","DOIUrl":null,"url":null,"abstract":"Two-sided matching problems exist widely in human beings' daily life. In this paper, two-sided matching decision making problems with heterogeneous incomplete preference relations are investigated. In order to obtain the optimal matching between matching objects on both sides, the priority weight vectors are firstly derived from each matching object's incomplete fuzzy or multiplicative preference relation over matching objects on the other side. Based on the priority weight vector, each matching object's satisfaction degrees over matching objects on the other side are calculated, based on which a bi-objective linear binary programming model is constructed and solved to determine the optimal matching. Finally, an example for employee-position matching is provided to illustrate the proposed approach.","PeriodicalId":208009,"journal":{"name":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Two-sided matching decision making based on heterogeneous incomplete preference relations\",\"authors\":\"Zhen Zhang, Xinyue Kou, W. Yu\",\"doi\":\"10.1109/ISKE.2017.8258739\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two-sided matching problems exist widely in human beings' daily life. In this paper, two-sided matching decision making problems with heterogeneous incomplete preference relations are investigated. In order to obtain the optimal matching between matching objects on both sides, the priority weight vectors are firstly derived from each matching object's incomplete fuzzy or multiplicative preference relation over matching objects on the other side. Based on the priority weight vector, each matching object's satisfaction degrees over matching objects on the other side are calculated, based on which a bi-objective linear binary programming model is constructed and solved to determine the optimal matching. Finally, an example for employee-position matching is provided to illustrate the proposed approach.\",\"PeriodicalId\":208009,\"journal\":{\"name\":\"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE.2017.8258739\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2017.8258739","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Two-sided matching decision making based on heterogeneous incomplete preference relations
Two-sided matching problems exist widely in human beings' daily life. In this paper, two-sided matching decision making problems with heterogeneous incomplete preference relations are investigated. In order to obtain the optimal matching between matching objects on both sides, the priority weight vectors are firstly derived from each matching object's incomplete fuzzy or multiplicative preference relation over matching objects on the other side. Based on the priority weight vector, each matching object's satisfaction degrees over matching objects on the other side are calculated, based on which a bi-objective linear binary programming model is constructed and solved to determine the optimal matching. Finally, an example for employee-position matching is provided to illustrate the proposed approach.