On saddlepoints of two-person zero-sum games with applications to data verification tests

A set of sufficient conditions for the existence of saddlepoint strategies of two-person zero-sum games is given which may be described as follows: Th e set of pure strategies for one of the two players is a compact metric spa ce. His opponent has a best answer to each randomized strategy. The payoff function satisfies a continuity condition concerning the weak convergence o f probability measures. These conditions are neither covered by those of we ll known existence theorems for saddlepoints nor do they generalize them. T hey are applied to treat important practical problems that have not been so lved before.