A neural network approach to solve the stable matching problem

被引：1
作者：
Yuan, YF [1 ]
Wang, L [1 ]
机构：
[1] BEIJING ECON & TRADING UNIV,DEPT INFORMAT MANAGEMENT,BEIJING,PEOPLES R CHINA
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1996年 / 93卷 / 02期
关键词：
matching; game theory; neural networks;
D O I：
10.1016/0377-2217(96)00039-2
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper two types of neurons, the maximum selection neuron and the maximum cut-off neuron are introduced. They are used to construct a neural network to represent and solve the stable matching problem. The neural network approach allows the matching to be processed dynamically in a distributed parallel processing environment.
引用
收藏
页码：331 / 345
页数：15
相关论文
共 17 条
  • [1] BYRNE JA, 1993, BUSINESS WEEK 0208, P99
  • [2] ELIZABETH M, 1984, INFORMATION PROCESSI, V18, P63
  • [3] COLLEGE ADMISSIONS AND STABILITY OF MARRIAGE
    GALE, D
    SHAPLEY, LS
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1962, 69 (01) : 9 - &
  • [4] THE MATCHING PROGRAM
    GRAETTINGER, JS
    PERANSON, E
    [J]. NEW ENGLAND JOURNAL OF MEDICINE, 1981, 304 (19) : 1163 - 1165
  • [5] Gusfield D., 1989, STABLE MARRIAGE PROB
  • [6] HOPFIELD JJ, 1985, BIOL CYBERN, V52, P145
  • [7] ITOGA SY, 1981, J OPER RES SOC, V32, P1069, DOI 10.2307/2581912
  • [8] WORST-CASE CHOICE FOR THE STABLE MARRIAGE PROBLEM
    KAPUR, D
    KRISHNAMOORTHY, MS
    [J]. INFORMATION PROCESSING LETTERS, 1985, 21 (01) : 27 - 30
  • [9] Kuhn H. W., 1955, Naval Research Logistics Quarterly, V2, P83, DOI [DOI 10.1002/NAV.3800020109, DOI 10.1002/NAV.20053]
  • [10] LIPPMANN RP, 1987, IEEE ASSP MAGAZI APR, P4
12