凸随机合作对策的核心

Core of Convex Stochastic Cooperative Game

本文将凸性扩展到随机合作对策中,从而得到凸随机合作对策具有超可加性与非空的核心,且凸随机合作对策的核心满足Minkowski和与Minkowski差。

This paper extends notions of superadditivity and convexity to stochastic cooperative games. It is shown that convex games are superadditive and have nonempty cores, and that the core of convex stochastic cooperative game satisfies the Minkowski sum and Minkowski difference.