Matrix Games with Interval-Valued 2-Tuple Linguistic Information
AbstractIn this paper, a two-player constant-sum interval-valued 2-tuple linguistic matrix game is construed. The value of a linguistic matrix game is proven as a non-decreasing function of the linguistic values in the payoffs, and, hence, a pair of auxiliary linguistic linear programming (LLP) problems is formulated to obtain the linguistic lower bound and the linguistic upper bound of the interval-valued linguistic value of such class of games. The duality theorem of LLP is also adopted to establish the equality of values of the interval linguistic matrix game for players I and II. A flowchart to summarize the proposed algorithm is also given. The methodology is then illustrated via a hypothetical example to demonstrate the applicability of the proposed theory in the real world. The designed algorithm demonstrates acceptable results in the two-player constant-sum game problems with interval-valued 2-tuple linguistic payoffs. View Full-Text
Share & Cite This Article
Singh, A.; Gupta, A. Matrix Games with Interval-Valued 2-Tuple Linguistic Information. Games 2018, 9, 62.
Singh A, Gupta A. Matrix Games with Interval-Valued 2-Tuple Linguistic Information. Games. 2018; 9(3):62.Chicago/Turabian Style
Singh, Anjali; Gupta, Anjana. 2018. "Matrix Games with Interval-Valued 2-Tuple Linguistic Information." Games 9, no. 3: 62.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.