Abstract: | The many-against-many battle, which is a variant of the Friedman's one-against-many battle, is formulated as a two-person constant-sum game. It is shown that the matrix which expresses this game has a saddle point. Some cases are presented in which the payoff matrix of the game can be reduced. Finally, some parametrically special cases are analyzed. |