A Note on Gale, Kuhn, and Tucker's Reductions of Zero-Sum Games

Abstract

Gale, Kuhn and Tucker [1] introduced two ways to reduce a zero-sum game by packaging some strategies with respect to a probability distribution on them. In terms of value, they gave conditions for a desirable reduction. We show that a probability distribution for a desirable reduction relies on optimal strategies in the original game. Also, we correct an improper example given by them to show that the reverse of a theorem does not hold.