N-person grey game
Author:
Kose Erkan,Forrest Jeffrey Yi-Lin
Abstract
Purpose
– One important assumption in the conventional cooperative game theory is that payoffs are assumed to be deterministic. In terms of the players’ cognitive ability of the realistic world, this is a very strict assumption. The classical game theory can find no way out when a particular game circumstance involves uncertainty, such as limited knowledge, small sample, and inadequate information, the payoff values of the game can only be described with interval grey numbers. The paper aims to discuss these issues.
Design/methodology/approach
– In this study the concept of N-person grey games is proposed in which payoffs are represented with interval grey numbers opposed to the classical game theory. A straight forward solution methodology is submitted compatible to grey numbers. Then, a currency war between anonymous countries is handled and modeled as an N-Person grey game. A generic currency war scenario is developed to follow the proposed solution procedure thoroughly.
Findings
– Based on the outcomes of this work, the authors can say that N-person grey game is an expansion of the classical N-person game under uncertain grey information and can be applied in more complex and uncertain environments, such as those seen in complicated currency warfare.
Originality/value
– This study combines the grey system theory with the classic N-person game theory and sets up the N-person grey game with grey payoff functions. Based on the grey number operating methods, the grey linear programming algorithm is established to calculate and distribute benefits to the players. In this respect this study has the feature of being the pioneer in the N-person grey game area.
Subject
Computer Science (miscellaneous),Social Sciences (miscellaneous),Theoretical Computer Science,Control and Systems Engineering,Engineering (miscellaneous)
Reference21 articles.
1. Bazara, M.S.
,
Jarvis, J.J.
and
Sherali, H.D.
(2010),
Linear Programming and Network Flows
, 4th ed., Wiley & Sons, NJ. 2. Driessen, T.
(1988),
Cooperative Games, Solutions, and Applications
, Kluwer Academic Publishers, Dordrecht. 3. Fang, Z.
and
Liu, S.F.
(2003), “Grey matrix game model based on pure strategy”,
Journal of Nanjing University of Aeronautics & Astronautics
, Vol. 35 No. 4, pp. 441-445. 4. Fang, Z.
,
Liu, S.F.
and
Ruan, A.
(2006b), “Study on venture problem of potential optimal pure strategy solution for grey interval number matrix game”,
KYBERNETES
, Vol. 35 Nos 7/8, pp. 1273-1283. 5. Fang, Z.
,
Liu, S.F.
and
Ruan, A.
(2006c), “Pure strategy solution and venture problem of grey matrix game based on undeterminable directly interval grey number”,
Journal of Jilin University
, Vol. 36 No. 1, pp. 137-142.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Grey Systems Theory Approach to Linear Programming;Advancements of Grey Systems Theory in Economics and Social Sciences;2023 2. On the Grey Obligation Rules;Springer Proceedings in Mathematics & Statistics;2021 3. Single machine earliness/tardiness scheduling problem with grey processing times and the grey common due date;Grey Systems: Theory and Application;2020-06-19 4. Sequencing grey games;Journal of Dynamics & Games;2020 5. Peer Group Situations and Games With Grey Uncertainty;Handbook of Research on Emergent Applications of Optimization Algorithms;2018
|
|