Rough set approach to bi-matrix game Online publication date: Fri, 01-May-2015
by Sankar Kumar Roy; Prasanta Mula
International Journal of Operational Research (IJOR), Vol. 23, No. 2, 2015
Abstract: The paper attempts to solve the bi-matrix game under rough set environment. The elements of the bi-matrix game are characterised by rough variables and defined as rough bi-matrix game (RBG). To handle RBG, we introduce the rough measurable function denoted as trust in it. Based on trust measure and rough expected operator, trust equilibrium strategies are defined for RBG. Then using rough set theory and game theory, the RBG converts into crisp quadratic programming problem (QPP) which depends upon the confidence level. Finally, using Wolfe's modified simplex method, the solution of RBG is derived. The numerical examples are presented to illustrate the methodology.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com