有最优解的n人合作对策是θ对策的θ上界

The θ-Upper Bound for n-Person Cooperative Games with the Best Solution Is a θ-Game

设Gn为全体n人合作对策的集合。本文找到一个定义在Gn上的实值函数L（v），使得v是θ对策[1]的充要条件是v有一个最优解且θ∈[0，min{1，L（v）}]。

Let G' be the set of all n-person cooperative games. This paper finds a real value func-tion L (v)defined on G', which satisfies the condition that v is a θ-game if and only if it has the best solution and θ∈ [0, min{1, L (v)}]