countable superadditivity

Finally,it gives the character of the core of a repeated stochastic cooperative game and extends the notions of superadditivity and convexity in the game.

以Su ijs等人(1995)引入的随机合作对策的模型为基础,建立了重复n人随机合作对策的理论,定义了重复n人随机合作对策的支付序列以及支付序列的优超关系,并由此给出了重复n人随机合作对策的核心、超可加性和凸性的定义,并讨论了该核心的一些特征和性质。

The sufficient condition for convex function to be superaddtive function;

凸函数成为超可加函数的充分条件