Research On Trading Matching Methods Of Electronic Brokerage And Its Applications

With the popularization of Internet, the researches and applications of electronic commerce have become a more and more important issue in the past few years. In electronic markets, the crucial purpose of a buyer or seller is to find the best fitting trading target in the time as short as possible. It seems to be very difficult in spite of the huge amount of information in the internet. The primary reason of the difficulty is that none can browse all the web pages in a limited time. Of course, it is impossible to find the fittest commodity. In addition, there are other more problems waiting for solution, such as trading trust in internet, trading efficiency, privacy protection and tax evasion.Facing this inconvenience, people are paying more and more attention to a kind of intermediary, which is called electronic brokerage. The concept of electronic broker (e-broker) is based on the use of new information technologies so as to provide a service capable of facilitating and organizing the relationship between customers and offer providers. It mimics the traditional commerce, where buyers and sellers meet together and negotiate in a marketplace, and pairs up agents for negotiating in an electronic environment. With an e-broker, buyers can save searching cost quite a lot; on the other hand, not every seller has his own web site to provide the selling information and thus falls back on an e-broker. Therefore, research on electronic broker is very important in theory and application. The major works of this paper are as follows:(1) Stability of matching is the chief part in bipartite matching electronic broker faces. In this paper, linear programming is adopted to solve the in-compete Gale-Sharply algorithm, which gets the advantage over H-R algorithm in matching number; Gale-Sharply and H-R algorithm are expanded to solve the "m-m" stable matching problem of electronic broker, which means multi-buyers and multi-sellers,...