|
|||||
|
|
| 最小费用k度限制树对策 | |
| 引用本文： | 王小燕 谢政. 最小费用k度限制树对策[J]. 数学理论与应用, 2005, 25(2): 53-56 |
| 作者姓名： | 王小燕 谢政 |
| 作者单位： | 国防科技大学理学院，长沙，410073 |
| 摘 要： | 本在Glover—Klingman算法及最小费用支撑树对策的基础上，讨论了最小费用k度限制树对策问题．利用威胁、旁支付理论制订了两种规则，并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解，从而证明了在这两种规则下其核心非空． |
| 关 键 词： | 最小费用 限制 支撑树 等价 |
Minimum cost k-degree constrained spanning tree game |
|
| Wang Xiaoyan Xie Zheng. Minimum cost k-degree constrained spanning tree game[J]. Mathematical Theory and Applications, 2005, 25(2): 53-56 | |
| Authors: | Wang Xiaoyan Xie Zheng |
| Abstract: | This paper develops Glover-Klingman algorithm and Minimu m cost spanning tree game to the Minimum cost k-degree constrained spanning tree game,formulate two strategies with the Threat theory and Side Payment theory,gi ves the solution in the Minimum cost spanning tree game core with dominate theor y and strategic equivalent theory,and proves that the core is non-empty under th e two rules. |
| Keywords: | Minimum cost spanning tree game Glover-Klingman algorithm Minimum cost k-degree costrained spanning tree game Dominate Strategic equivalent Core |
| 本文献已被 CNKI 维普 等数据库收录！ | |