A minimax problem for Porter's class of functionals is considered in the case when the two players' strategies are elements of convex and strongly or weakly compact subsets of real Hilbert spaces. Functional analysis is used to prove sufficient conditions ensuring the existence of saddle points. An example illustrates the results, and a necessary condition of optimality of strategies is given in a particular case.