Abstract

We consider a class of games, which we call “groups’ games”, in which players are partitioned into classes within which players may be considered indistinguishable. We compute explicit formulas for some of the principal values restricted to these games. This is particularly useful for dealing with games with a large number of players where the usual formulas would be impractical to compute. We give several examples that illustrate how this idea may be applied to concrete situations.