Solution of Matrix Games with Generalised Trapezoidal Fuzzy Payoffs

In this paper, it is shown that once linear ranking function is chosen, then the fuzzy matrix game (FMG) is converted into crisp one and then it is solved easily by the proposed method. The main aim of this paper is to reduce the computational complexity of the FMG using the ranking function. The applicability and feasibility of the FMG is illustrated with a numerical example. This paper finalises with the conclusion and to include an outlook for future study in this direction.