| Article ID: | iaor20063596 |
| Country: | China |
| Volume: | 25 |
| Issue: | 2 |
| Start Page Number: | 53 |
| End Page Number: | 56 |
| Publication Date: | Jun 2005 |
| Journal: | Mathematical Theory and Applications |
| Authors: | Xie Zheng, Wang Xiaoyan |
| Keywords: | networks |
This paper develops Glover–Klingman algorithm and minimum cost spanning tree to the minimum cost k-degree constrained spanning tree game, formulates two strategies with the Threat theory and Side Payment theory, gives the solution in the minimum cost spanning tree game core with dominate theory and strategic equivalent theory, and proves that the core in non-empty under the two rules.