Graphical solution of (n x m) matrix of a game theory

被引:1
作者
Kumar, S [1 ]
Reddy, DSN [1 ]
机构
[1] MH Saboo Siddik Coll Engn, Bombay 400008, Maharashtra, India
关键词
D O I
10.1016/S0377-2217(97)00412-8
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Game theory deals with decisions under uncertainty involving two or more intelligent opponents in which each opponent aspires to optimise his own decision at the expense of the other opponents. To solve the matrix of game theory, graphical method is the easiest compared to other methods such as dominance property, matrix method etc. In the graphical method it is assumed that there is no saddle point. But till now graphical method is restricted to (2 x m) or (n x 2) matrix only. This paper highlights, the solution of (n x m) matrix by graphical method, which is solved by dominance property till date. This method is easier to understand and takes less time to Set the solution. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:467 / 471
页数:5
相关论文
共 3 条
[1]  
GUPTA PK, 1992, OPERATIONS RES
[2]  
HAMDY AT, 1987, OPERATIONS RES
[3]  
VOHRA ND, 1995, QUANTITATIVE TECHNIQ