Game theory problem solver through linear programming using simplex algorithm. This project is done for master degree in Faculty of Organization and Informatics, Varaždin.

These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.

For installing this software you can find Publish directory in this repository or open in Visual Studio.

This application is based on zero sum games for example:

A\B|_Y1_Y2_Y3
X1 | 2 5 -3
X2 | -1 3 2
X3 | 3-5 -4

Player A has 3 strategies - X1, X2, X3 while player B also has 3 strategies - Y1, Y2, Y3.

Every strategy carry some payoff for player, for example if player A plays strategy X1 and player B strategy Y1 - player A has payoff of 2 units (player B loses 2 units). In other side, if player A plays strategy X1 and player B strategy Y3 - player B has payoff of 3 units (player A loses 3 units).

This application either for player A or player B makes calculation using linear programming, apropos simplex algorithm to find value of entered game and the percentage of each player's playing strategy.

Result for upper game would be:
The game value: 0,2
Probability of playing a player's strategy:
Player A: X1 = 0% X2 = 70% X3 = 30%
Player B: Y1 = 60% Y2 = 0% Y3 = 40%

In addition application can create model of problem for entered game indicating the entire linear programming process. Also, user can see all computation made for simplex allgorithm.

• C# - Windows forms used

• Dino Kliček - Initial work - dineeek

This project is licensed under the MIT License - see the LICENSE.md file for details