同济大学学报（自然科学版）2013，Vol.41Issue(1)：155-158,4.DOI:10.3969/j.issn.0253-374x.2013.01.026
稳定匹配问题中的纳什均衡
Nash Equilibrium in Stable Matching Problems
摘要
Abstract
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.关键词
稳定匹配/纳什均衡/GS算法Key words
stable matching/ Nash equilibrium/ GS algorithm分类
数理科学引用本文复制引用
王烨,李雨生..稳定匹配问题中的纳什均衡[J].同济大学学报（自然科学版）,2013,41(1):155-158,4.
