Solving Two-Person Zero-Sum Game by Matlab

Abstract

In this article we present an overview on two-person zero-sum games, which play a central role in the development of the theory of games. Two-person zero-sum games is a special class of game theory in which one player wins what the other player loses with only two players. It is difficult to solve 2-person matrix game with the order m×n(m≥3,n≥3). The aim of the article is to determine the method on how to solve a 2-person matrix game by linear programming function linprog() in matlab. With linear programming techniques in the Matlab software, we present effective method for solving large zero-sum games problems.

A Game-Theoretic Approach for Network Security Using Honeypots

“…To solve this payoff matrix and use the algorithm developed in [19], we must convert the matrix to have no negative entries by adding a suitable fixed number to all the entries in the matrix. Let us add 110, and the new matrix is x r = (0.0032, 0, 0, 0.0088) (28) and for the second LP, we used the translation of (25) and obtained After applying the linprog function in Matlab for 1, 10, 50, and 100 service(s)/host(s) in our environment using the method described earlier, we calculated the payoff matrix.…”