Game on Zero Sum
| dc.contributor.advisor | Guta, Berhanu (PhD) | |
| dc.contributor.author | Haileslassie, Amha | |
| dc.date.accessioned | 2021-03-26T09:23:08Z | |
| dc.date.accessioned | 2023-11-04T12:31:13Z | |
| dc.date.available | 2021-03-26T09:23:08Z | |
| dc.date.available | 2023-11-04T12:31:13Z | |
| dc.date.issued | 2020-06-22 | |
| dc.description.abstract | A game with two rational players in which the gain payo for one is loss for the other is called two person zero-sum game. i.e the sum of payo s for the two players are zero. Two person zero-sum game with nite sets of strategies are called matrix games. Rational players always seeks to maximize his payo by choosing a best strategy. If the matrix of the game is payo for Player 1, then player 1 at worst case guarantee himself to maximize the minimum loss of player 2. Similarly player 2 at worst case guarantee himself to minimize the maximum payo player 1. Any mixed matrix game has optimal solution which is called saddle point in mixed strategies. This project is focuses only on two person zero-sum game part of Game Theory with nite player strategies and present how to nd the optimal value of the game or optimal solution strategies(saddle point) of the players. To nd optimality solution method of primal(dual) linear programming problem and dominance strategy methods are used. The objective is to nd the optimal strategies of the players in two person zero-sum game and optimal value of the game. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/25712 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Game | en_US |
| dc.subject | Zero | en_US |
| dc.subject | Sum | en_US |
| dc.title | Game on Zero Sum | en_US |
| dc.type | Thesis | en_US |