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.