The purpose of this thesis is to learn the concept of balanced cooperative game in a somewhat geometrical approach. Some well known notions and results are explained by a series of examples. We consider the finite real families or indexed by integers or sets as points in suitable Euclidean spaces and give some examples of nonempty closed bounded sets. The exact solution of the extreme points of a special polyhedral subset is computed which is helpful to realize the notions of balanced collections and minimal balanced collections. Linear programming, especially the asymmetric form of duality, is needed, and we choose some examples to illustrate these notions. The nonemptyness of the core of a given game is closed related to the value of a corresponding feasible linear program and we may handle this by studying its dual problem which would lead us to get a concept of balanced game.