Nash equilibrium in stable matching problems

被引：0
|
作者：
Wang, Ye [1 ]
Li, Yusheng [1 ]
机构：
[1] Department of Mathematics, Tongji University
来源：
Tongji Daxue Xuebao/Journal of Tongji University | 2013年 / 41卷 / 01期
关键词：
GS algorithm; Nash equilibrium; Stable matching;
D O I：
10.3969/j.issn.0253-374x.2013.01.026
中图分类号：
学科分类号：
摘要：
We consider the stable matching problem in graph theory, and find the stable matching actually follows the principal of Nash equilibrium. In addition, a program of GS algorithm for solutions is conducted. A matching problem is also given and the solution is obtained with the Matlab program. Finally, the study results are extended to the coloring problem and shortest path problem.
引用
收藏
页码：155 / 158
页数：3
相关论文
共 7 条
  • [1] Gale D., Shapley L.S., College admissions and the stability of marriage, The American Mathematical Monthly, 69, 1, (1962)
  • [2] Bollobas B., Modern Graph Theory, (2003)
  • [3] Brualdi R.A., Introductory Combinatorics, (2004)
  • [4] Nash J., Non-cooperative games, Annals of Mathematics, 54, (1951)
  • [5] Dubins L.E., Freedman D.A., Machiavelli and the Gale-Shapley algorithm, The American Mathematical Monthly, 88, 7, (1981)
  • [6] Huang C.C., Cheating by men in the Gale-Shapley stable matching algorithm, Lecture Notes in Computer Science, 4168, (2006)
  • [7] Gusfield D., Irving R.W., The Stable Marriage Problem: Structure and Algorithm, (1989)
1