Solving matrix game using rough interval payoffs

Abstract

In this paper, we conduct an analysis of a matrix game using rough interval payoffs, which we refer to as the rough interval matrix game (RIMG). We employ three methods to address the problem at hand: linear programming, graphical method, and algebraic method. The proposed approach offers several key advantages over existing methods, which we highlight. We introduce algorithms associated with each of the three mentioned methods to obtain optimal solutions for the RIMG. To validate the effectiveness of our proposed techniques, we present two numerical examples and apply the methodologies to solve them. In conclusion, we summarize the findings of our study and discuss potential avenues for future research based on the insights provided in this paper.