[P]Nash Finder - find Nash equilibrium for all games

[https://github.com/lansiz/nash-finder](https://github.com/lansiz/nash-finder)

**This program helps to find Nash equilibrium (NE) for any type of games. It is especially useful for those games with more than two players, which oftentimes are unsolvable.**

# Example 1: find NE for two-person games

​

[ Payoff bimatrix of two-person game](https://preview.redd.it/9rlmz6coomf91.png?width=691&format=png&auto=webp&s=2a097c5b11bf9ef7a4a604de86df620417489004)

import grm
game = grm.Game()
# two playeys, and each player uses THREE pure strategies
game.player_join(grm.Player(3))
game.player_join(grm.Player(3))
game.player_init_mixed_strategies()
# assign the payoff (define the payoff function)
# player 1
game.player_assign_payoff(1, "11", -231)
game.player_assign_payoff(1, "12", -505) …

equilibrium games machinelearning nash equilibrium