Graphical solution of (n×m) matrix of a game theory

Game theory deals with decisions under uncertainty involving two or more intelligent opponents in which each opponent aspires to optimise his own decision at the expense of the other opponents. To solve the matrix of game theory, graphical method is the easiest compared to other methods such as dominance property, matrix method etc. In the graphical method it is assumed that there is no saddle point. But till now graphical method is restricted to (2×m) or (n×2) matrix only. This paper highlights, the solution of (n×m) matrix by graphical method, which is solved by dominance property to date. This method is easier to understand and takes less time to get the solution.