Analysis of Nash equilibria for Kuhn poker and its extensions

With a proper poker strategy you could potentially win a lot of money, but poker is too large to solve analytically. That is where simplified games come into play. One of the most researched simplified poker games is Kuhn poker, a two-player game that has been solved analytically. This paper looks at an adjusted best response algorithm to find Nash equilibria of Kuhn poker. Multiple extensions have been made to Kuhn poker, such as adding a third player. This paper describes how three-player Kuhn poker could be extended to a repeated game, and shows that playing a Nash equilibrium in a single stage game can result in a negative expected value in the repeated version. Lastly, this paper shows how blinds could be added to two-player Kuhn poker, and how this influences the equilibria.