当前位置: X-MOL 学术IEEE Trans. Fuzzy Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Ambika methods for solving matrix games with Atanassov's intuitionistic fuzzy payoffs
IEEE Transactions on Fuzzy Systems ( IF 11.9 ) Pub Date : 2018-02-01 , DOI: 10.1109/tfuzz.2017.2651103
Tina Verma , Amit Kumar

In the last few years, a lot of researchers have proposed different methods, to solve the mathematical programming problem of matrix games with Atanassov's intuitionistic fuzzy payoffs. In this paper, the flaws of the existing methods for solving matrix games with Atanassov's intuitionistic fuzzy payoffs (matrix games in which payoffs are represented by Atanassov's intuitionistic fuzzy numbers) are pointed out. Also, to resolve these flaws, new methods (named as Ambika methods) are proposed to obtain the optimal strategies as well as minimum expected gain of Player I and maximum expected loss of Player II for matrix games with Atanassov's intuitionistic fuzzy payoffs. To illustrate proposed Ambika methods, some existing numerical problems of matrix games with Atanassov's intuitionistic fuzzy payoffs are solved by proposed Ambika methods.

中文翻译:

用 Atanassov 的直觉模糊收益求解矩阵博弈的 Ambika 方法

近年来,许多研究者提出了不同的方法,用 Atanassov 的直觉模糊收益求解矩阵博弈的数学规划问题。本文指出了现有求解具有阿塔纳索夫直觉模糊收益的矩阵博弈(收益由阿塔纳索夫直觉模糊数表示的矩阵博弈)方法的缺陷。此外,为了解决这些缺陷,提出了新的方法(称为 Ambika 方法)来获得最优策略以及玩家 I 的最小预期收益和玩家 II 的最大预期损失,用于具有 Atanassov 直觉模糊收益的矩阵博弈。为了说明所提出的 Ambika 方法,使用 Atanassov' 的矩阵博弈的一些现有数值问题
更新日期:2018-02-01
down
wechat
bug