Implementatations of Regret Minimization and Counterfactual Regret Minimization in Python.
These are implemented as outlined in An Introduction to Counterfactual Regret Minimization (Neller and Lanctot) (paper here)
rps.py: finds a correlated equilibrium in Rocks-Paper-Scissors, which in this case happens to be the Nash equilibrium. It is very similar to the code found in this YouTube video
kuhn.py: finds a correlated equilibrium in Kuhn Poker which is a toy poker game described in the paper and previously.
kuhn_3.py: finds a correlated equilibrium in 3 player Kuhn Poker, as described in this paper