Solving Triangular Intuitionistic Fuzzy Matrix Game by Applying the Accuracy Function Method

Abstract

In this paper, the matrix game based on triangular intuitionistic fuzzy payoff is put forward. Then, we get a conclusion that the equilibrium solution of this game model is equivalent to the solution of a pair of the primal–dual single objective intuitionistic fuzzy linear optimization problems $\left(IFLOP1\right)$ and $\left(IFLOD1\right)$. Furthermore, by applying the accuracy function, which is linear, we transform the primal–dual single objective intuitionistic fuzzy linear optimization problems $\left(IFLOP1\right)$ and $\left(IFLOD1\right)$ into the primal–dual discrete linear optimization problems $\left(GLOP1\right)$ and $\left(GLOD1\right).$ The above primal–dual pair $\left(GLOP1\right)$–$\left(GLOD1\right)$ is symmetric in the sense the dual of $\left(GLOD1\right)$ is $\left(GLOP1\right)$. Thus the primal–dual discrete linear optimization problems $\left(GLOP1\right)$ and $\left(GLOD1\right)$ are called the symmetric primal–dual discrete linear optimization problems. Finally, the technique is illustrated by an example.

1. Introduction

Since the 1940s [1,2], game theory has been extensively studied in a systematic and axiomatic way. This is an important milestone in the development of game theory. Generally, games can be divided into two categories: Zero sum game and non-zero sum game. In this paper, we study the zero sum game model. The zero sum game is also known as the matrix game. The data of the classical matrix game model is discrete and precise. Indeed, in practice, players cannot accurately evaluate game data and accurately express their preferences and choices. Therefore, fuzzy set is introduced in [3], and it provides a very powerful tool to deal with the subjective judgment of players and the inaccuracy of game data. Many researchers discuss the problem of the fuzzy matrix game from different viewpoints. In [4], fuzzy sets are first used in cooperative game theory. Subsequently, However, Butnariu et al. [5] introduced fuzzy set in game theory and proposed fuzzy game. The maximum–minimum equilibrium problem of the fuzzy matrix game is discussed in [6]. Bector et al. [7] discussed the fuzzy matrix game in detail. Dubois [8] studied matrix games on account of fuzzy payoffs. Fuzzy linear optimization problems with fuzzy parameters are studied in [9]. Moreover, they use this optimization problem to study matrix games based on fuzzy goals and fuzzy payoffs. Afterwards, by fuzzy relation, they also propose a generalized matrix game model on account of fuzzy payoffs and fuzzy goals in [10].

However, in some cases, players could only know the payoff approximately based on some imprecise degree. However, it is possible players are not sure about it. In other words, there may be some hesitation about the approximate value of the reward. The fuzzy set uses only a membership function to indicate the degree of belonging, whereas the degree of non-belongingness is a compliment to one. In fact, in practice, it is not easy to describe a satisfactory compensation valve of players due to insufficient information available. So, there remains a part of uncertainty of which hesitation survives. Thus fuzzy sets do not synthesize hesitation degree well. Comparatively speaking, Atanassov [11] proposed the definition of intuitionistic fuzzy set. Intuitionistic fuzzy set is a generalization of fuzzy set theory and is now found to be very suitable for dealing with ambiguous problems. The intuitionistic fuzzy set is characterized by two functions representing the degree of membership and the degree of non-membership. Moreover, the sum of the two values is less than or equal to one. The hesitation degree is equal to 1 minus the degree of membership and the degree of non-membership. Hence, the intuitionistic fuzzy set may express information more abundant and flexible than the fuzzy set when uncertain information is involved. The theory of intuitionistic fuzzy sets has been studied in [12,13]. The theory of intuitionistic fuzzy sets has been widely used in decision making, topology and medical science [14,15,16,17,18,19].

In recent years, many researchers have mainly studied intuitionistic fuzzy matrix games, as in [20,21,22]. A matrix game model of payoffs based on intuitionistic fuzzy sets is proposed in [20]. Li [21] established a theoretical system of decision making and game theory by utilizing intuitionistic fuzzy sets, and this theoretical system provides effective tools for solving complex management problems. Afterwards, Nan [22] came up with a matrix game in which the payoff matrix is a trapezoidal intuitionistic fuzzy number. Nan [23] proposed a bi-matrix game model with intuitionistic fuzzy goals and intuitionistic fuzzy payoffs. An [24] studied intuitionistic fuzzy bi-matrix games by a mean-area ranking based a non-linear programming approach. Nayak et al. [25] studied bi-matrix games with intuitionistic fuzzy goals. Aggarwal et al. [26] researched matrix games based on intuitionistic fuzzy goals and intuitionistic fuzzy payoffs. Moreover, they [27] solved matrix game models with intuitionistic fuzzy goals by the linear optimization method. Seikh et al. [28] presented a model for studying bi-matrix games based on intuitionistic fuzzy goals. A matrix game model with triangular intuitionistic fuzzy numbers was considered in [29]. Moreover, solutions of the game are transformed into crisp linear programming problems by a suitable defuzzification function method. Yager [30] considered the expected value for membership function by finding the expected interval for a triangular fuzzy number. Singh et al. [31] used the same method to give the expected value of the non-membership function. Moreover, the expected values are called score functions. Taking the average (accuracy function) of two expected values being formed of expected interval as a single quantity can get a better approximation for comparison of the process of Yager. Singh et al.’s [31,32] discussion of the definition of triangular intuitionistic fuzzy number is different from other discussion in the literature. Hence, in this paper, we put forward a new model of a matrix game based on triangular intuitionistic fuzzy numbers. We utilize the accuracy function method [31] and single intuitionistic fuzzy optimization method [32] to solve the new model of matrix game based on the triangular intuitionistic fuzzy payoff.

The framework of this paper is as follows: Section 2 briefly depicts the basic knowledge of crisp matrix game models, intuitionistic fuzzy sets and the intuitionistic fuzzy optimization theory. Section 3 puts forward the matrix game based on the triangular intuitionistic fuzzy payoff. Then, we get a conclusion that the equilibrium solution of this game model is equivalent to the solution of a single objective intuitionistic fuzzy linear optimization problem. Furthermore, by applying the accuracy function, which is linear, we transform the single objective intuitionistic fuzzy linear optimization problem into the discrete linear optimization problem. An example is given in Section 4. Section 5 summarizes the full text.

2. Preliminaries

In this part, we first depict a crisp matrix game model in [7,33].

Definition 1

([33]). The mixed strategies space of player I is denoted by

$$S^m=\{x={(x_1,x_2,\cdots ,x_m)}^T\in {\mathbb{R}}^m|{\displaystyle \sum _{i=1}^m}{x}_i=1,x_i\ge 0,i=1,2,\cdots ,m.\}$$

(1)

Similarly, The mixed strategies space of player II is denoted by

$$S^n=\{y={(y_1,y_2,\cdots ,y_n)}^T\in {\mathbb{R}}^n|{\displaystyle \sum _{j=1}^n}{y}_j=1,y_j\ge 0,j=1,2,\cdots ,n.\}$$

(2)

where $x^T$ is the transposition of x, ${\mathbb{R}}^m$ and ${\mathbb{R}}^n$ are m- and n-dimensional Euclidean spaces. The elements $x_i$ $(i=1,2,\cdots ,m)$ of $S^m$ are called mixed strategies of player I. Similarly, the elements $y_j$ $(j=1,2,\cdots ,n)$ of $S^n$ are called mixed strategies of player II.

A payoff matrix of crisp a matrix game is taken as follows [7]:

$$A=\left(\begin{array}{ccc}{a}_{11}& \cdots & a_{1n}\\ ⋮& \ddots & ⋮\\ a_{m1}& \cdots & a_{mn}\end{array}\right)$$

(3)

In order not to lose generality, we suppose that players I and II are maximized players. If player I chooses $x_i$ mixed strategy and player II chooses $y_j$ mixed strategy then $a_{ij}$ is the amount paid by player II to player I. $-a_{ij}$ is the amount paid by player I to player II. That is, the gain of one player is the loss of other player.

A single objective matrix game $\left(G\right)$ [7] is defined by

$$G=(S^m,S^n,A).$$

(4)

Definition 2

([7]). If $x\in S^m$ and $y\in S^n$, a vector

$$\begin{array}{c}E\left(x,y,A\right)=x^{T}Ay\hfill \end{array}$$

(5)

is called an expected payoff of player I. As the game G is zero-sum, the payoff of player II is $-x^{T}Ay$.

Definition 3

([7]). If $x\in S^m$ and $y\in S^n$ satisfy the following requirements:

$$x^{*}Ay\ge V^{*},\forall y\in S^n,$$

$$xA{y}^{*}\le W^{*},\forall x\in S^m.$$

then, $x^{*}$ and $y^{*}$ are called the Nash equilibrium solution for players I and II, respectively. Moreover, $V^{*}$ and $W^{*}$ are called the value of $G.$

Given a game G model, its solution can be obtained by solving the following discrete single objective linear optimization problems $\left(GLOP\right)$ and $\left(GLOD\right)$.

$\left(GLOP\right)$      max V

$$\begin{array}{c}\mathrm{such}\mathrm{that}{\displaystyle \sum _{i=1}^m}{a}_{ij}{x}_i\ge V,(j=1,2,\cdots ,n),\hfill \\ \forall x\in S^m,\forall y\in S^n,\hfill \end{array}$$

(6)

$\left(GLOD\right)$      min W

$$\begin{array}{c}\mathrm{such}\mathrm{that}{\displaystyle \sum _{j=1}^n}{a}_{ij}{y}_j\le W,(i=1,2,\cdots ,m),\hfill \\ \forall x\in S^m,\forall y\in S^n.\hfill \end{array}$$

(7)

Next, we give the definition of triangular intuitionistic fuzzy number and its related knowledge.

Definition 4

([11]). Supposed that $\mathbb{R}$ is a finite universe set. ${\tilde{a}}^I$ of $\mathbb{R}$ is said to be an intuitionistic fuzzy set if ${\tilde{a}}^I$ of $\mathbb{R}$ satisfies the following condition

$${\tilde{a}}^I=\{\langle x,u_{{\tilde{a}}^I}\left(x\right),v_{{\tilde{a}}^I}\left(x\right)\rangle :x\in \mathbb{R}\}$$

(8)

where $u_{{\tilde{a}}^I}\left(x\right),v_{{\tilde{a}}^I}\left(x\right):\mathbb{R}\to [0,1]$ are functions such that $0\le u_{{\tilde{a}}^I}\left(x\right)+v_{{\tilde{a}}^I}\left(x\right)\le 0,\forall x\in \mathbb{R}.$ $u_{{\tilde{a}}^I}\left(x\right)$ and $v_{{\tilde{a}}^I}\left(x\right)$ denote degree of membership and degree of non-membership for $x\in \mathbb{R}$ in ${\tilde{a}}^I,$ respectively.

Definition 5

([11]). Supposing that ${\tilde{a}}^I$ is an intuitionistic fuzzy set, if $u_{{\tilde{a}}^I}\left(x\right)$ and $v_{{\tilde{a}}^I}\left(x\right)$ of ${\tilde{a}}^I$ satisfy the following conditions

$$u_{{\tilde{a}}^I}\left(x\right)=\left\{\begin{array}{c}\frac{x-a_1}{a_2-a_1},a_1<x\le a_2,\hfill \\ \frac{a_3-x}{a_3-a_2},a_2<x<a_3,\hfill \\ 0,\mathit{otherwise},\hfill \end{array}\right.$$

(9)

and

$$v_{{\tilde{a}}^I}\left(x\right)=\left\{\begin{array}{c}\frac{a_2-x}{a_2-a_1^{{}^{\prime }}},a_1^{{}^{\prime }}<x\le a_2,\hfill \\ \frac{x-a_2}{a_3^{{}^{\prime }}-a_2},a_2<x<a_3^{{}^{\prime }},\hfill \\ 1,\mathit{otherwise}.\hfill \end{array}\right.$$

(10)

where $a_1^{{}^{\prime }}\le a_1\le a_2\le a_3\le a_3^{{}^{\prime }},$ then ${\tilde{a}}^I$ is said to be a triangular intuitionistic fuzzy number. Moreover, ${\tilde{a}}^I$ is denoted by ${\tilde{a}}^I=(a_1,a_2,a_3;a_1^{{}^{\prime }},a_2,a_3^{{}^{\prime }}).$ The set of all triangular intuitionistic fuzzy numbers is denoted by $IF\left(\mathbb{R}\right).$

Definition 6

([11]). Assuming that ${\tilde{a}}^I=(a_1,a_2,a_3;a_1^{{}^{\prime }},a_2,a_3^{{}^{\prime }})$ and ${\tilde{b}}^I=(b_1,b_2,b_3;b_1^{{}^{\prime }},b_2,b_3^{{}^{\prime }})$ are triangular intuitionistic fuzzy numbers, the addition of ${\tilde{a}}^I$ and ${\tilde{b}}^I$ is defined by

$${\tilde{a}}^I\oplus {\tilde{b}}^I=(a_1+b_1,a_2+b_2,a_3+b_3;a_1^{{}^{\prime }}+b_1^{{}^{\prime }},a_2+b_2,a_3^{{}^{\prime }}+b_3^{{}^{\prime }}).$$

Let $k>0$ be real number. Scalar multiplication of ${\tilde{a}}^I$ is defined by

$$k{\tilde{a}}^I=(k{a}_1,k{a}_2,k{a}_3;k{a}_1^{{}^{\prime }},k{a}_2,k{a}_3^{{}^{\prime }}).$$

Let $k<0$ be real number. Scalar multiplication of ${\tilde{a}}^I$ is defined by

$$k{\tilde{a}}^I=(k{a}_3,k{a}_2,k{a}_1;k{a}_3^{{}^{\prime }},k{a}_2,k{a}_1^{{}^{\prime }}).$$

Definition 7

([31]). Let ${\tilde{a}}^I=(a_1,a_2,a_3;a_1^{{}^{\prime }},a_2,a_3^{{}^{\prime }})$ be a triangular intuitionistic fuzzy number. The score function of $u_{{\tilde{a}}^I}\left(x\right)$, denoted by $S\left(u_{{\tilde{a}}^I}\left(x\right)\right)$, is defined as $S\left(u_{{\tilde{a}}^I}\left(x\right)\right)=\frac{a_1+2a_2+a_3}{4}.$ The score function of $v_{{\tilde{a}}^I}\left(x\right)$, denoted by $S\left(v_{{\tilde{a}}^I}\left(x\right)\right)$, is defined as $S\left(v_{{\tilde{a}}^I}\left(x\right)\right)=\frac{a_1^{{}^{\prime }}+2a_2+a_3^{{}^{\prime }}}{4}.$ Then, the accuracy function of ${\tilde{a}}^I$, denoted by $f\left({\tilde{a}}^I\right)$, is defined as $f\left({\tilde{a}}^I\right)=\frac{S\left(u_{{\tilde{a}}^I}\left(x\right)\right)+S\left(v_{{\tilde{a}}^I}\left(x\right)\right)}{2}=\frac{(a_1+2a_2+a_3)+(a_1^{{}^{\prime }}+2a_2+a_3^{{}^{\prime }})}{8}.$

Theorem 1

([31]). The accuracy function $f:IF\left(\mathbb{R}\right)\to \mathbb{R}$ is a linear function.

Definition 8

([32]). Assuming that ${\tilde{a}}^I=(a_1,a_2,a_3;a_1^{{}^{\prime }},a_2,a_3^{{}^{\prime }})$ and ${\tilde{b}}^I=(b_1,b_2,b_3;b_1^{{}^{\prime }},b_2,b_3^{{}^{\prime }})$ are triangular intuitionistic fuzzy numbers, if $f\left({\tilde{a}}^I\right)\le f\left({\tilde{b}}^I\right),$ then we say ${\tilde{a}}^I⪯{\tilde{b}}^I$; if $f\left({\tilde{a}}^I\right)\ge f\left({\tilde{b}}^I\right),$ then we say ${\tilde{a}}^I⪰{\tilde{b}}^I$.

Finally, we give a single objective intuitionistic fuzzy linear optimization problem model and its relevant knowledge.

A single objective intuitionistic fuzzy linear optimization problem $\left(IFLOP\right)$ model is given by [32]

$\left(IFLOP\right)$$min\{{\displaystyle \sum _{j=1}^n}{\left({\tilde{c}}_j\right)}^I{x}_j\}$

$$\begin{array}{c}subjectto{\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^I{x}_j⪰{\left({\tilde{b}}_i\right)}^I(i=1,2,\cdots ,m_1),\hfill \\ {\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^I{x}_j⪯{\left({\tilde{b}}_i\right)}^I(i=m_1+1,m_1+2,\cdots ,m_2),\hfill \\ {\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^I{x}_j={\left({\tilde{b}}_i\right)}^I(i=m_2+1,m_2+2,\cdots ,m),\hfill \\ x_j\ge 0,(j=1,2,\cdots ,n)\hfill \end{array}$$

(11)

where ${\left({\tilde{a}}_{ij}\right)}^I$, ${\left({\tilde{b}}_i\right)}^I$ and ${\left({\tilde{c}}_j\right)}^I$ are triangular intuitionistic fuzzy numbers.

According to Theorem 1, a single objective intuitionistic fuzzy linear optimization problem $\left(IFLOP\right)$ model is converted to a discrete linear optimization problem $\left(LOP\right)$ model [32]

$\left(LOP\right)$$min\{{\displaystyle \sum _{j=1}^n}{\left({\tilde{c}}_j\right)}^{{}^{\prime }}{x}_j\}$

$$\begin{array}{c}subjectto{\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{x}_j\ge {({\tilde{b}}_i)}^{{}^{\prime }}(i=1,2,\cdots ,m_1),\hfill \\ {\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{x}_j\le {({\tilde{b}}_i)}^{{}^{\prime }}(i=m_1+1,m_1+2,\cdots ,m_2),\hfill \\ {\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{x}_j={({\tilde{b}}_i)}^{{}^{\prime }}(i=m_2+1,m_2+2,\cdots ,m),\hfill \\ x_j\ge 0,(j=1,2,\cdots ,n)\hfill \end{array}$$

(12)

where ${({\tilde{a}}_{ij})}^{{}^{\prime }}=f({({\tilde{a}}_{ij})}^I)$, ${({\tilde{b}}_i)}^{{}^{\prime }}=f({({\tilde{b}}_i)}^I)$ and ${({\tilde{c}}_j)}^{{}^{\prime }}=f({({\tilde{c}}_j)}^I)$ $(i=1,2,\cdots ,m;j=1,2,\cdots ,n).$

Theorem 2

([32]). An optimal solution of a discrete linear optimization problem $\left(LOP\right)$ model is an optimal solution of a single objective intuitionistic fuzzy linear optimization problem $\left(IFLOP\right)$ model.

Note that solving a single objective intuitionistic fuzzy linear optimization problem $\left(IFLOP\right)$ model is equal to solving a discrete linear optimization problem $\left(LOP\right)$ model.

3. A Matrix Game Based on Triangular Intuitionistic Fuzzy Payoff

In this section, we will put forward a matrix game model based on triangular intuitionistic fuzzy payoff. Assuming that $S^m$ and $S^n$ are introduced as in Section 2, because practical problems in real life are complex and tedious, players cannot accurately evaluate game model data and express their preferences. In the following, let us assume that the elements of the payoff matrix ${\tilde{A}}^I$ are triangular intuitionistic fuzzy numbers. Supposing that aspiration levels ${\tilde{V}}^I$ and ${\tilde{W}}^I$ of players I and II are triangular intuitionistic fuzzy numbers; thus, a matrix game based on triangular intuitionistic fuzzy payoff, denoted by $TIFG$, is described as

$$TIFG=(S^m,S^n,{\tilde{A}}^I,{\tilde{V}}^I,{\tilde{W}}^I)$$

(13)

where

$${\tilde{A}}^I=\left(\begin{array}{ccc}{\left({\tilde{a}}_{11}\right)}^I& \cdots & {\left({\tilde{a}}_{1n}\right)}^I\\ ⋮& \ddots & ⋮\\ {\left({\tilde{a}}_{m1}\right)}^I& \cdots & {\left({\tilde{a}}_{mn}\right)}^I\end{array}\right)$$

(14)

Definition 9.

If $x\in S^m$ and $y\in S^n$, a vector

$$\begin{array}{c}E\left(x,y,{\tilde{A}}^I\right)=x^T{\tilde{A}}^{I}y\hfill \end{array}$$

(15)

is called an intuitionistic fuzzy expected payoff of player I. As the game $TIFG$ is zero-sum, the intuitionistic fuzzy expected payoff of player II is $-x^T{\tilde{A}}^{I}y$.

Definition 10.

If $x\in S^m$ and $y\in S^n$ satisfy the following requirements:

$$x^{*}{\tilde{A}}^{I}y⪰{\left({\tilde{V}}^I\right)}^{*},\forall y\in S^n,$$

$$x{\tilde{A}}^I{y}^{*}⪯{\left({\tilde{W}}^I\right)}^{*},\forall x\in S^m.$$

then, $(x,y)\in S^m\times S^n$ is called the equilibrium solution of $TIFG,$ where $x^{*}$ and $y^{*}$ are called the equilibrium solution of players I and II, respectively.

To solve the game $TIFG$ model, we give the following theorem.

Theorem 3.

Let $(x,y)\in S^m\times S^n.$ If $(x,y)$ is the equilibrium solution of $TIFG$ if and only if $(x,{\tilde{V}}^{{}^{\prime }})$ and $(y,{\tilde{W}}^{{}^{\prime }})$ are the optimal solution of discrete linear optimization problems $\left(GLOP1\right)$ and $\left(GLOD1\right)$

$\left(GLOP1\right)$      max ${\tilde{V}}^{{}^{\prime }}$

$$\begin{array}{c}suchthat{\displaystyle \sum _{i=1}^m}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{x}_i\ge {\tilde{V}}^{{}^{\prime }},(j=1,2,\cdots ,n),\hfill \\ \forall x\in S^m,\forall y\in S^n,\hfill \end{array}$$

$\left(GLOD1\right)$     min ${\tilde{W}}^{{}^{\prime }}$

$$\begin{array}{c}suchthat{\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{y}_j\le {\tilde{W}}^{{}^{\prime }},(i=1,2,\cdots ,m),\hfill \\ \forall x\in S^m,\forall y\in S^n.\hfill \end{array}$$

where ${\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}=f\left({\left({\tilde{a}}_{ij}\right)}^I\right)$, ${\tilde{V}}^{{}^{\prime }}=f\left({\tilde{V}}^I\right)$ and ${\tilde{W}}^{{}^{\prime }}=f\left({\tilde{W}}^I\right)$ $(i=1,2,\cdots ,m;j=1,2,\cdots ,n).$

Proof. 

By using Definition 10, we get that $(x,y)$ is the equilibrium solution of $TIFG$ if and only if $(x,y)$ is an optimal solution of intuitionistic fuzzy optimization problems $\left(IFOP\right)$ and $\left(IFOD\right).$

$\left(IFOP\right)$     Find $x\in S^m$ such that

$$x{\tilde{A}}^{I}y⪰{\tilde{V}}^I,\forall y\in S^n,$$

$\left(IFOD\right)$     Find $y\in S^n$ such that

$$x{\tilde{A}}^{I}y⪯{\tilde{W}}^I,\forall x\in S^m.$$

since $S^m$ and $S^n$ are convex polytopes. Moreover, the problems $IFOP$ and $IFOD$ are crisp intuitionistic fuzzy linear optimization problems; it is sufficient to consider only the extreme points of $S^m$ and $S^n.$ Thus the problems $IFOP$ and $IFOD$ can be rewritten as

$\left(IFLOP1\right)$     max ${\tilde{V}}^I$

$$\begin{array}{c}\mathrm{such}\mathrm{that}{\displaystyle \sum _{i=1}^m}{\left({\tilde{a}}_{ij}\right)}^I{x}_i⪰{\tilde{V}}^I,(j=1,2,\cdots ,n),\hfill \\ \forall x\in S^m,\forall y\in S^n,\hfill \end{array}$$

$\left(IFLOD1\right)$     min ${\tilde{W}}^I$

$$\begin{array}{c}\mathrm{such}\mathrm{that}{\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^I{y}_j⪯{\tilde{W}}^I,(i=1,2,\cdots ,m),\hfill \\ \forall x\in S^m,\forall y\in S^n.\hfill \end{array}$$

By applying the accuracy function, which is linear, and utilizing problems $IFLOP,$ $LOP$ and Theorem 2, we find that the problems $\left(IFLOP1\right)$ and $\left(IFLOD1\right)$ are equivalent to problems $GLOP1$ and $GLOD1,$ respectively.

$\left(GLOP1\right)$     max ${\tilde{V}}^{{}^{\prime }}$

$$\begin{array}{c}\mathrm{such}\mathrm{that}{\displaystyle \sum _{i=1}^m}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{x}_i\ge {\tilde{V}}^{{}^{\prime }},(j=1,2,\cdots ,n),\hfill \\ \forall x\in S^m,\forall y\in S^n,\hfill \end{array}$$

$\left(GLOD1\right)$     min ${\tilde{W}}^{{}^{\prime }}$

$$\begin{array}{c}\mathrm{such}\mathrm{that}{\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{y}_j\le {\tilde{W}}^{{}^{\prime }},(i=1,2,\cdots ,m),\hfill \\ \forall x\in S^m,\forall y\in S^n.\hfill \end{array}$$

where ${\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}=f\left({\left({\tilde{a}}_{ij}\right)}^I\right)$, ${\tilde{V}}^{{}^{\prime }}=f\left({\tilde{V}}^I\right)$ and ${\tilde{W}}^{{}^{\prime }}=f\left({\tilde{W}}^I\right)$ $(i=1,2,\cdots ,m;j=1,2,\cdots ,n).$ □

Theorem 4.

Let $(x,y)\in S^m\times S^n.$ If $(x,y)$ is an optimal solution of discrete linear optimization problems $\left(GLOP1\right)$ and $\left(GLOD1\right),$ then ${\tilde{V}}^{{}^{\prime }}\le {\tilde{W}}^{{}^{\prime }}.$

Proof. 

Since $(x,y)$ is an optimal solution of discrete linear optimization problems $\left(GLOP1\right)$ and $\left(GLOD1\right),$ by Theorem 3, we have

$${\displaystyle \sum _{i=1}^m}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{x}_i\ge {\tilde{V}}^{{}^{\prime }},(j=1,2,\cdots ,n)$$

and

$${\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{y}_j\le {\tilde{W}}^{{}^{\prime }},(i=1,2,\cdots ,m)$$

Since $\forall x\in S^m,\forall y\in S^n,$ we get

$${\displaystyle \sum _{j=1}^n}{\displaystyle \sum _{i=1}^m}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{x}_i{y}_j\ge {\displaystyle \sum _{j=1}^n}{\tilde{V}}^{{}^{\prime }}{y}_j={\tilde{V}}^{{}^{\prime }}$$

and

$${\displaystyle \sum _{i=1}^m}{\displaystyle \sum _{j=1}^n}{\left({\tilde{a}}_{ij}\right)}^{{}^{\prime }}{y}_j{x}_i\le {\displaystyle \sum _{i=1}^m}{\tilde{W}}^{{}^{\prime }}{x}_i={\tilde{W}}^{{}^{\prime }}$$

Thus, we have ${\tilde{V}}^{{}^{\prime }}\le {\tilde{W}}^{{}^{\prime }}.$ □

4. Example

Assuming that the demand for wine in the market is essentially the same, wine company I and wine company II aim to obtain their market share. (Where wine companies I and II represent players I and II in the above game $TIFG$, respectively.) The two wine companies come up with two alternative marketing strategies: Advertising investment (${\alpha }_1$) and reducing-price sale (${\alpha }_2$). Due to the uncertainty and imprecision of information, the management of wine companies I and II cannot use any single value to represent the payoff for any one of the marketing strategies. To deal with this uncertainty, a matrix game based on triangular intuitionistic fuzzy payoff of wine company I is considered as follows

$${\tilde{A}}^I=\left(\begin{array}{c}(7,8,8;6,8,9),(5.5,6,6.5;5,6,7)\\ (5,5,6;5,5,7),(9,9,10;8.5,9,10)\end{array}\right)$$

where $(7,8,8;6,8,9)$ denotes the profit of wine company I if wine companies I and II choose advertising investment $\left({\alpha }_1\right).$ Similarly, other elements in ${\tilde{A}}^I$ can be given.

In order to solve the above practical problems, by Definition 7, we have

$$f\left((7,8,8;6,8,9)\right)=\frac{(7+2\times 8+8)+(6+2\times 8+9)}{8}=7.75$$

$$f\left((5.5,6,6.5;5,6,7)\right)=\frac{(5.5+2\times 6+6.5)+(5+2\times 6+7)}{8}=6$$

$$f\left((5,5,6;5,5,7)\right)=\frac{(5+2\times 5+6)+(5+2\times 5+7)}{8}=5.375$$

$$f\left((9,9,10;8.5,9,10)\right)=\frac{(9+2\times 9+10)+(8.5+2\times 9+10)}{8}=9.1875$$

By using Theorem 3, we need to solve discrete linear optimization problems $\left(GLOP2\right)$ and $\left(GLOD2\right).$

$\left(GLOP2\right)$     max ${\tilde{V}}^{{}^{\prime }}$

$$\begin{array}{c}\mathrm{such}\mathrm{that}7.75x_1+5.375x_2\ge {\tilde{V}}^{{}^{\prime }},\hfill \\ 6x_1+9.1875x_2\ge {\tilde{V}}^{{}^{\prime }},\hfill \\ x_1+x_2=1,x_1\ge 0,x_2\ge 0,\hfill \end{array}$$

$\left(GLOD2\right)$     min ${\tilde{W}}^{{}^{\prime }}$

$$\begin{array}{c}\mathrm{such}\mathrm{that}7.75y_1+6y_2\le {\tilde{W}}^{{}^{\prime }},\hfill \\ 5.375y_1+9.1875y_2\le {\tilde{W}}^{{}^{\prime }},\hfill \\ y_1+y_2=1,y_1\ge 0,y_2\ge 0.\hfill \end{array}$$

Solving the above problems $\left(GLOP2\right)$ and $\left(GLOD2\right)$ by utilizing LINGO, we can obtain that $((x_1^{*}=0.32,x_2^{*}=0.68),{({\tilde{V}}^{{}^{\prime }})}^{*}=6.135)$ is an optimal solution of problems $\left(GLOP2\right)$ and $((y_1^{*}=0.68,y_2^{*}=0.32),{({\tilde{W}}^{{}^{\prime }})}^{*}=7.19)$ is an optimal solution of problems $\left(GLOD2\right).$ By Theorem 3, $((x_1^{*}=0.32,x_2^{*}=0.68),(y_1^{*}=0.68,y_2^{*}=0.32))$ is the equilibrium solution of $TIFG$. Namely, $(x_1^{*}=0.32,x_2^{*}=0.68)$ and $(y_1^{*}=0.68,y_2^{*}=0.32)$ are market shares held by wine companies I and II, respectively. ${({\tilde{V}}^{{}^{\prime }})}^{*}=6.135$ is the expected profit of wine company I. ${({\tilde{W}}^{{}^{\prime }})}^{*}=7.19$ is the expected profit of wine company II.

5. Conclusions

This paper has presented a matrix game based on triangular intuitionistic fuzzy payoff. Moreover, we obtain the conclusion that the equilibrium solution of this game model is equivalent to the solution of a single objective intuitionistic fuzzy linear optimization problem. Furthermore, by applying the accuracy function, which is linear, we transform the single objective intuitionistic fuzzy linear optimization problem into the discrete linear optimization problem. The matrix game theory based on triangular intuitionistic fuzzy payoff in this paper will be applied in other fields such as decision making and management.