Sufficient conditions are given for a general n person game to have a nonempty core. The conditions are a consequence of convexity of preferences if the game arises from an exchange economy. The proof of sufficiency is based on a finite algorithm, and makes no use of fixed point theorems.