In this paper, sufficient conditions are given, which are less restrictive than those required by the Arrow-Debreu-Nash theorem, on the existence of a Nash equilibrium of an n-player game {Y-1, ..., Y-n, f(1), ..., f(n)} in normal form with a nonempty closed convex constraint C on the set Y = Pi (i) Y-i of multistrategies. The ith player has to minimize the function f(i) with respect to the ith variable. We consider two cases. In the first case, Y is a real Hilbert space and the loss function class is quadratic. In this case, the existence of a Nash equilibrium is guaranteed as a simple consequence of the projection theorem for Hilbert spaces. In the second case, Y is a Euclidean space, the loss functions are continuous, and f(i) is convex with respect to the ith variable. In this case, the technique is quite particular, because the constrained game is approximated with a sequence of free games, each with a Nash equilibrium in an appropriate compact space X. Since X is compact, there exists a subsequence of these Nash equilibrium points which is convergent in the norm. If the limit point is in C and if the order of convergence is greater than one, then this is a Nash equilibrium of the constrained game.
