弱1—凸对策及其解的性质

PROPERTIES OF WEAK 1-CONVEX GAMES AND THEIR SOLUTION

本文提出了一类特殊的ｎ人合作对策模型─—弱１—凸对策，研究了弱１—凸对策的解的性质，并证明弱１—凸对策的解满足所有常见的公理化特征．

In this paper the n-person cooperative games-weak 1-convex games are presented.The one-point solution concept for the games is developed.It is shown that for the weak 1-convex games,the solution of the games satisfies all axiomatic characterizations in game theory.