Cores of convex and strictly convex games

We follow the path initiated by Shapley in 1971 and study the geometry of the core of convex and strictly convex games. We define what we call face games and use them to study the combinatorial complexity of the core of a strictly convex game. Remarkably, we present a picture that summarizes our results with the aid of Pascal's triangle.