MasterAI decisively defeated 14 top human Texas hold'em poker professsionals in September 2020.
-
Updated
Oct 27, 2021 - C++
MasterAI decisively defeated 14 top human Texas hold'em poker professsionals in September 2020.
MasterAI decisively defeated 14 top human Texas hold'em poker professsionals in September 2020.
Computation of Nash Equilibrium in Reachability Games
This solver uses the support enumeration method for Nash Equilibrium computation of a 2-player bimatrix game.
Prototype C++ implementations of multi-terminal BDD node-table and symbolic Bellman-Ford for graph games
Heads Up Push or Fold Nash Equilibrium Solver
Nash equilibria finder, hacked for an university course on game theory.
A Nash Equilibria solver for normal form (matrix) games (bi-matrix, zero-sum, and symmetric). Solves for pure and mixed strategies.
Computing dominant strategies and equilibria for an N player-finite game
Add a description, image, and links to the nash-equilibrium topic page so that developers can more easily learn about it.
To associate your repository with the nash-equilibrium topic, visit your repo's landing page and select "manage topics."