摘要
介绍了稳定性双边匹配的概念,概括了Gale-Sharply和H-R算法求解1-1和1-k的计算过程.考虑商品的多属性,给出了交易者按综合满意程度对满足自己约束对方的排序计算方法.将Gale-Sharply和H-R算法从理论上扩展到"p-k"情况,用来解决电子中介处理稳定的多对多双边匹配问题.最后证明了扩展算法所得结果的稳定性,并给出了算例.
Abstract： The concept of stable bipartite matching is introduced, and the algorithm of solving 1-1 and 1-k stable matching problem using Gale-Sharply and H-R（hospital-resident） algorithm is summarized. Considering the multiattribute of commodity, an algorithm is given, by which one dealer can rank his Satisfying opposite party according to the synthesis satisfaction degree. Gale-Sharply and H-R algorithm are extended theoretically to ＂p-k＂ matching to solve the many-many stable bipartite matching problem of electronic broker. The stability of the algorithm is proved and a calculating example is given in the end.
出处
《控制与决策》
EI
CSCD
北大核心
2008年第4期388-391,共4页
Control and Decision
基金
国家自然科学基金重点项目(70431003)
鲁东大学校基金重点项目(20064301)
