Game on Zero Sum

dc.contributor.advisorGuta, Berhanu (PhD)
dc.contributor.authorHaileslassie, Amha
dc.date.accessioned2021-03-26T09:23:08Z
dc.date.accessioned2023-11-04T12:31:13Z
dc.date.available2021-03-26T09:23:08Z
dc.date.available2023-11-04T12:31:13Z
dc.date.issued2020-06-22
dc.description.abstractA 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.urihttp://etd.aau.edu.et/handle/123456789/25712
dc.language.isoenen_US
dc.publisherAddis Ababa Universityen_US
dc.subjectGameen_US
dc.subjectZeroen_US
dc.subjectSumen_US
dc.titleGame on Zero Sumen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Amha Haileslassie 2020.pdf
Size:
483.02 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:

Collections