Nash Q Learning with 2 agents
Published:
Implementation of the Nash Q-Learning algorithm to solve games with two agents, as seen in the course Multiagent Systems @ PoliMi. The algorithm was first introduced in the paper Nash Q-Learning for general-sum stochastic games (Hu, J., Wellman, M.P., 2003).
Feel free to use for your own projects or contribute!
[link]