In this paper, we will study one of the concepts of game theory,
which is the Nash equilibrium and mixed strategy.
And how to find mixed strategy Nash equilibrium Which aims to
find the optimal possibilities corresponding to each strategy thus
ensuring better profit for each player chosen so as not inconsistent
with the interests of others.
In this research proposal a time linear algorithm to find the
optimal strategy in Stable game theory, that the value of game is
fixed number, where the lower Value Game and the upper Value
Game are equal. this algorithm is based on the principle o
f nonprofitable
delete strategies or strategies that are utility to adopt less
utility if we adopt another strategy. The goal is to ease the expense
of Nash equilibrium and stability points and access to optimal
solution for the game.
