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: The set of pure strategies for one of the two players is a compact metric space. His opponent has a best answer to each randomized strategy. The payoff function satisfies a continuity condition concerning the weak convergence of probability measures. These conditions are neither covered by those of well known existence theorems for saddlepoints nor do they generalize them. They are applied to treat important practical problems that have not been solved before.