SOLVING MATRIX GAME USING ROUGH INTERVAL PAYOFFS

Date

2024-10-01

Author

Ghosh, Piyush
Bhaumik, Ankan
Weber, Gerhard Wilhelm
Roy, Sankar Kumar

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

54
views

0
downloads

Cite This

In this paper, we conduct an analysis of a matrix game using rough interval payoffs, which we refer to as the rough interval matrix game (RIMG). We employ three methods to address the problem at hand: linear programming, graphical method, and algebraic method. The proposed approach offers several key advantages over existing methods, which we highlight. We introduce algorithms associated with each of the three mentioned methods to obtain optimal solutions for the RIMG. To validate the effectiveness of our proposed techniques, we present two numerical examples and apply the methodologies to solve them. In conclusion, we summarize the findings of our study and discuss potential avenues for future research based on the insights provided in this paper.

Subject Keywords

decision making problem, equilibrium strategies, graphical and algebraic method, linear programming, rough interval, Two-person zero-sum game

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85199680011&origin=inward
https://hdl.handle.net/11511/110692

Collections

Graduate School of Applied Mathematics, Article