Rough set approach to bi-matrix game

The paper attempts to solve the bi‐matrix game under rough set environment. The elements of the bi‐matrix game are characterised by rough variables and defined as rough bi‐matrix game (RBG). To handle RBG, we introduce the rough measurable function denoted as trust in it. Based on trust measure and rough expected operator, trust equilibrium strategies are defined for RBG. Then using rough set theory and game theory, the RBG converts into crisp quadratic programming problem (QPP) which depends upon the confidence level. Finally, using Wolfe's modified simplex method, the solution of RBG is derived. The numerical examples are presented to illustrate the methodology.