Loading…
Matrix Games with Interval-Valued 2-Tuple Linguistic Information
In 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...
Saved in:
Published in: | Games 2018-09, Vol.9 (3), p.62 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In 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. |
---|---|
ISSN: | 2073-4336 2073-4336 |
DOI: | 10.3390/g9030062 |