Ⅰ. INTRODUCTION One has proposed the solutions for n-person coalition games. J. von Neumann and O. Morgenstern found the stable set of the game in 1944. Gillies gave the definition of the core c(v) of the game in 195...Ⅰ. INTRODUCTION One has proposed the solutions for n-person coalition games. J. von Neumann and O. Morgenstern found the stable set of the game in 1944. Gillies gave the definition of the core c(v) of the game in 1955. But up to now, in general, there is no criterion for the existence of a core or a stable set, so Shapley defined展开更多
The solution of convex linear combinational game of the random coalition games on the ZS-Axiom is given. With this solution, the scale of the solution to combinational game and the scale of convex linear combinational...The solution of convex linear combinational game of the random coalition games on the ZS-Axiom is given. With this solution, the scale of the solution to combinational game and the scale of convex linear combinational game under certain circumstances are widened.展开更多
文摘Ⅰ. INTRODUCTION One has proposed the solutions for n-person coalition games. J. von Neumann and O. Morgenstern found the stable set of the game in 1944. Gillies gave the definition of the core c(v) of the game in 1955. But up to now, in general, there is no criterion for the existence of a core or a stable set, so Shapley defined
文摘The solution of convex linear combinational game of the random coalition games on the ZS-Axiom is given. With this solution, the scale of the solution to combinational game and the scale of convex linear combinational game under certain circumstances are widened.
