Matching problem of electronic broker based on stable bipartite matching
Zhang Zhen-hua · Kongzhi yu juece · 2008
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 multi-attribute 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.