• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Wuhan International Conference on E-Business; 20070526-27; Wuhan(CN) >Research on Stable Matching Problem of Electronic Broker
【24h】

Research on Stable Matching Problem of Electronic Broker

机译：电子经纪人稳定匹配问题研究

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper introduces the concept of bipartite matching and summarizes the algorithm of solving 1-1 and 1-k matching problem using Gale-Sharply and H-R algorithm. Considering the multi-attribute of commodity, we give an algorithm 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 bipartite stable matching problem of electronic broker, in which there are many buyers and sellers, who have many goods of the same kind to trade. This extended algorithm can find the optimal stable matching pairs for both sides. The stability of the algorithm is proved in the paper and a calculating example is given in the end.
机译：本文介绍了二分匹配的概念，并总结了使用Gale-Sharply和H-R算法解决1-1和1-k匹配问题的算法。考虑到商品的多属性，我们给出了一种算法，通过该算法，交易者可以根据综合满意度对自己满意的对方进行排名。从理论上将Gale-Sharply和H-R算法扩展到“ p-k”匹配，以解决电子经纪人的许多两方稳定匹配问题，在该问题中，有许多买卖双方，有许多同类商品进行交易。该扩展算法可以找到双方的最佳稳定匹配对。文中证明了算法的稳定性，并给出了算例。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号