N-Person Games — V: Stable-Set Solutions Including an Arbitrary Closed Component

A proof of a stable-set solution to a simple n-person game, which includes an arbitrary closed subset of a certain (n-3)-dimensional convex region in the simplex of imputations, at a finite distance from the rest of the solution.