Abstract : The minimax theorem of von Neumann can be applied to the matrix Α-λΙ where Α is an irreducible matrix with nonnegative entries. The associated value function ν(λ) and the optimal mixed strategies for the two players for ν(μ) = 0 for some μ turn out to be the Perron root and the associated eigenvector. A theorem of Kaplanski shows that the game is completely mixed and thus the algebraic simplicity of μ is a direct consequence of this game theoretic result. For normal cones in real relexive Banach spaces, the theorem of Krein on positive operators do yield positive eigen value and an eigenvector in the cone. The proof uses the general minimax theorem.