Mixed versus pure strategies in many-person decision problems

In many-person decision problems, the optimal strategy has been searched for among the class of pure, as opposed to mixed, strategies. It is proved that if the payoff functions satisfy certain convexity conditions, optimal pure strategies are also optimal in the expanded class of mixed strategies.