On separable non-cooperative zero-sum games

Non-cooperative zero-sum games which can be concerted to linear programs are considered. The obtained linear programs have very restriction matrices but the rank of these matrices is significantly lower than their size. An important example of such games is the resource allocation problem. A method for constructing an equilibrium point in such games is developed