In this paper we generalize the concept of coalitional games by allowingfor any organizational structure within coalitions represented by a graphon the set of players ot the coalition. A, possibly empty, set of payoffvectors is assigned to any graph on every subset of players. Such a gamewill be called a graph game. For each graph a power vector is determinedthat depends on the relative positions of the players within the graph.A collection of graphs will be called balanced if to any graph in the collection apositive weight can be assigned such that the weighted power vectorssum up to the vector of ones. We then define the balanced-core as a refinement ofthe core. A payoff vector lies in the balanced-core if it lies in the core andthe payoff vector is an element of payoff sets of all graphs in some balanced collection ofgraphs. We prove that any balanced graph game has a nonempty balanced-core.We conclude by some examples showing the usefulness of the conceptsof graph games and balanced-core. In particular these examples show a closerelationship between solutions to noncooperative games andbalanced-core elements of a well-defined graph game.
