🚀 A very efficient Texas Holdem GTO solver
Gambit: The package for computation in game theory
This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
A Matlab Toolbox for Cooperative Game Theory
Computing mixed-strategy Nash Equilibria for games involving multiple players
A module for solving linear programming problems on Python.
In this repository, the best solutions of data structures, combinatorial algorithms, game theory, artificial intelligence will be assembled. All implementations in the Javascript programming language.
Software codes for running the Game-theoretic Utility Tree (GUT) algorithm for the multi-robot Pursuit-Evasion problem in the Robotarium's simulator-hardware multi-robot testbed.
This repository analyses Strategic form games for N-player calculating various Equilibrium's, Calculate MSNE for 2-Player strategic form and zero sum game, Also contains algorithm for N-player finite Mechanism design to check if social choice function is SDSE, Ex-Post-efficient and Non-dictatorial.
A Mathematica Package for Cooperative Game Theory
Collection of materials and code samples on reinforcement learning / optimal control and game theory
University of Pisa Optimization Methods and Game Theory
Python implementation of the Gale-Shapley Algorithm.
This project is focused on building a tool to calculate the expected value (EV) of poker hands in the popular card game Texas Holdem. The tool will allow players to make more informed decisions by analyzing the EV of different hand scenarios and betting strategies.
Game-theoretic clusterization algorithm
A prisoner's dilemma agent based model simulation for investigating effects of differing strategies on emergent behaviours and spatial patterns with configurable environments.
🐋 A repository for useful algorithms and data structures
This repository contains a Python implementation of the Top Trading Cycle Algorithm, a mechanism for solving the problem of allocating indivisible items or resources among agents with preferences. The algorithm is widely used in the field of matching theory, particularly in the context of school choice and house allocation problems.
Add a description, image, and links to the game-theory-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the game-theory-algorithms topic, visit your repo's landing page and select "manage topics."