The aim of this article is to propose a novel and simple technique for solving bi-matrix games with rough intervals payoffs. Since the payoffs of the rough bi-matrix games are rough intervals, then its value is also a rough interval. In this technique, we derived four bilinear programming problems, which are used to obtain the upper lower bound, lower lower bound, lower upper bound and upper upper bound of the rough interval values of the players in rough bi-matrix games which we called in this article as 'solution space'. Moreover, the expected value operator and trust measure of rough interval have been used to find the α-trust equilibrium strategies and the expected equilibrium strategies of rough interval bi-matrix games. Finally, numerical example of tourism planning management model is presented to illustrate the methodologies adopted and solution procedure.