A Linear Programming Approach to Solve Constrained Bi-matrix Games with Intuitionistic Fuzzy Payoffs
- 56 Downloads
In many real games, two players’ payoffs are not exactly opposite and players often have some constraints or preference on their strategies. Such kinds of games are called constrained bi-matrix games (CBGs) for short. Based on dual programming theory, two linear programming models are developed for solving any CBG. Then, a classic example of bi-matrix games called the Rock-scissors-cloth game with considering players’ preference on strategies is used to show the validity of the proposed models and method. Furthermore, we investigate on the CBGs with payoffs represented by intuitionistic fuzzy numbers, which are simply called intuitionistic fuzzy CBGs in which both the ambiguity of the payoffs and the constraints of the strategies are taken into account. At last, the effectiveness of the proposed models and method is demonstrated with a numerical example of the company development strategy choice problem.
KeywordsIntuitionistic fuzzy numbers (IFNs) Bi-matrix games (BGs) Constrained bi-matrix games (CBGs) Mathematical programming
- 2.Bhurjee, A.K., Panda, G.: Optimal strategies for two-person normalized matrix game with variable payoffs. Oper. Res. 17(2), 547–562 (2017)Google Scholar
- 3.Liu, T., Deng, Y., Chan, F.: Evidential supplier selection based on DEMATEL and game theory. Int. J. Fuzzy Syst. 20(2), 1–13 (2017)Google Scholar
- 14.Pang, J.H., Zhang, Q.: The equilibrium strategies of bi-matrix games with interval-valued payoffs. Syst. Eng. 25(4), 114–118 (2007)Google Scholar
- 26.Firouzbakht, K., Noubir, G., Salehi, M.: Constrained bimatrix games in wireless communications. IEEE Trans. Commun. 64(1), 1–11 (2015)Google Scholar