基于語(yǔ)言偏好信息的滿(mǎn)意公平穩(wěn)定雙邊匹配方法

摘要： 針對(duì)語(yǔ)言偏好信息下的雙邊匹配問(wèn)題,提出一種考慮匹配滿(mǎn)意性、公平性和穩(wěn)定性的雙邊匹配方法.首先,通過(guò)構(gòu)造匹配滿(mǎn)意度計(jì)算規(guī)則,將雙邊主體的語(yǔ)言偏好信息轉(zhuǎn)化為匹配滿(mǎn)意度;然后,給出滿(mǎn)意匹配、公平匹配和穩(wěn)定匹配的定義,在此基礎(chǔ)上,考慮穩(wěn)定匹配約束條件,建立雙邊匹配多目標(biāo)優(yōu)化模型,采用理想點(diǎn)法將多目標(biāo)優(yōu)化模型轉(zhuǎn)化為單目標(biāo)規(guī)劃模型進(jìn)行求解;最后,通過(guò)一個(gè)算例驗(yàn)證了提出方法的可行性和有效性.
A two-sided matching method considering satisfaction,fairness and stability of the matching is proposed to solve two-sided matching problems with linguistic preference information.Firstly,linguistic preference information of agents on both sides are transformed into matching satisfaction degree by developing the calculating rules of matching satisfaction degree.Secondly,concepts on satisfaction,fairness and stability of the matching are given.Furthermore,considering the stable matching constraint condition,a multiple objective optimization two-sided matching model is constructed.Then,the ideal point method is used to convert the multiple objective optimization model into a single objective programming model,which produces the two-sided matching results.Finally,an example is given to prove the feasibility and validity of the proposed method.