(R1976) A Novel Approach to Solve Fuzzy Rough Matrix Game with Two Players

This paper proposes a new method for solving a two-person zero-sum fuzzy matrix game with goals, payoffs, and decision variables represented as triangular fuzzy rough numbers. We created a pair of fully fuzzy rough linear programming problems for players. Triangular fuzzy rough numbers can be used to formulate two fuzzy linear programming problems for the first player in the form of upper approximation intervals and lower approximation intervals. Two problems for the second player can be created in the same way. These problems have been split into five sub-crisp problems for the player first and five sub-crisp problems for the player second. The solution to the game can be obtained by solving these ten fuzzy linear programming problems. To demonstrate the method, a numerical example is provided. Using Wolfram Cloud, optimal strategies and game values are calculated for various parameters. Sensitivity analysis is carried out by altering the values of parameters

A method to solve two-player zero-sum matrix games in chaotic environment

This research article proposes a method for solving the two-player zero-sum matrix games in chaotic environment. In a fast growing world, the real life situations are characterized by their chaotic behaviors and chaotic processes. The chaos variables are defined to study such type of problems. Classical mathematics deals with the numbers as static and less value-added, while the chaos mathematics deals with it as dynamic evolutionary, and comparatively more value-added. In this research article, the payoff is characterized by chaos numbers. While the chaos payoff matrix converted into the corresponding static payoff matrix. An approach for determining the chaotic optimal strategy is developed. In the last, one solved example is provided to explain the utility, effectiveness and applicability of the approach for the problem.Abbreviations: DM= Decision Maker; MCDM = Multiple Criteria Decision Making; LPP = Linear Programming Problem; GAMS= General Algebraic Modeling System

Complexity Theory, Game Theory, and Economics: The Barbados Lectures

This document collects the lecture notes from my mini-course "Complexity Theory, Game Theory, and Economics," taught at the Bellairs Research Institute of McGill University, Holetown, Barbados, February 19--23, 2017, as the 29th McGill Invitational Workshop on Computational Complexity. The goal of this mini-course is twofold: (i) to explain how complexity theory has helped illuminate several barriers in economics and game theory; and (ii) to illustrate how game-theoretic questions have led to new and interesting complexity theory, including recent several breakthroughs. It consists of two five-lecture sequences: the Solar Lectures, focusing on the communication and computational complexity of computing equilibria; and the Lunar Lectures, focusing on applications of complexity theory in game theory and economics. No background in game theory is assumed.Comment: Revised v2 from December 2019 corrects some errors in and adds some recent citations to v1 Revised v3 corrects a few typos in v

Cooperative and Noncooperative Solutions, and the \u27Game within a Game\u27

In a previous essay, we developed a simple (in)efficiency measure for matrix games. We now address the difficulties encountered in assessing the usefulness and accuracy of such a measure