ABSTRACT
In the solution process of the grey matrix game model based on a grey mixed strategy, the grey full-rank matrix is a brief and available method that contains abundant information for solution. We prove in the following that in the grey inverse matrix of a grey full-rank expansion square matrix, grey elements in the last row and column correspond respectively to solutions of an optimal grey game strategy and the grey game values of Players 1 and 2.
