Compound Simple Games I

An investigation of the solutions of the games that are formed by combining two or more simple games, played by separate groups of individuals. A simple game is one that is completely specified by its winning coalitions. Two forms of combinations are studied: the sum, in which the coalition wins if it wins in either component, and the product, in which a coalition wins only if it wins in both components. In both cases, relationships are established between the solutions of the compound games and those of the components