Game trees were first denned by Von Neumann and Morgenstern in 1944.
对策树首先由Von Neumann和Morgenstern在1944年提出并进行研究。
Here we discuss the tactics between the bankruptcy and MCST in cooperation,and the relations among all of their answers.
讨论合作对策中破产对策与最小费用树对策的各种解之间的关系，通过构造网络图，给出了将破产问题化为最小费用树对策的一个充分条件，从而给出破产对策核仁解的一种有效方
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.
本文在Glover-Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题。
