Solution of Game Theory Problems by New Approach

In this paper, an alternative approach to the Simplex method for game theory problem is suggested. Here we proposed a new approach based on the iterative procedure for the solution of a game theory problem by alternative simplex method. The method sometimes involves less or at the most an equal numb...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of advanced research in computer science Vol. 8; no. 5; p. 1214
Main Authors Khobragade, N W, Lokhande, Kalpana, Khot, P G
Format Journal Article
LanguageEnglish
Published Udaipur International Journal of Advanced Research in Computer Science 01.05.2017
Subjects
Computation
Cycles
Game theory
Iterative methods
Simplex method
Online AccessGet full text

Cover

More Information
Summary:In this paper, an alternative approach to the Simplex method for game theory problem is suggested. Here we proposed a new approach based on the iterative procedure for the solution of a game theory problem by alternative simplex method. The method sometimes involves less or at the most an equal number of iteration as compared to computational procedure for solving NLPP. We observed that the rule of selecting pivot vector at initial stage and thereby for some NLPP it takes more number of iteration to achieve optimality. Here at the initial step we choose the pivot vector on the basis of new rules described below. This powerful technique is better understood by resolving a cycling problem.
ISSN:0976-5697
DOI:10.26483/ijarcs.v8i5.3668