摘要
继J.von Neumann和O.Morgenstern首次建立了和一合成对策之后。人们又建立了一些新的合成对策模型。但这些模型所研究的均是有限个特殊对策的合成问题。本文研究了可列个有限人一般对策的合成问题,建立了可列人单位化p-合成对策模型,并讨论了可列人单位化p-合成对策的稳定集。
After the first model of sum-compound game, some models of compound game were established. But in these models, only the composition of finite special games were studied. In this paper, the composition of countable finite-person games is studied, and the model of unitized p-compound countable-person game is established, and a theorem about the stable set of this new model is given and proved.
出处
《中国科学院研究生院学报》
CAS
CSCD
1993年第4期375-381,共7页
Journal of the Graduate School of the Chinese Academy of Sciences
