aicenter / TensorCFR
☆9Updated 6 years ago
Alternatives and similar repositories for TensorCFR:
Users that are interested in TensorCFR are comparing it to the libraries listed below
- Collection of game-theoretic algorithms for Poker☆29Updated 6 years ago
- Counterfactual Regret Minimization for poker games☆21Updated 5 years ago
- Fictitious Self-play & Reinforcement Learning☆18Updated 7 years ago
- Reinforcement learning algorithms to play Poker☆15Updated 3 years ago
- Scalable Implementation of Neural Fictitous Self-Play☆77Updated 6 years ago
- Potential-Aware Imperfect-Recall Abstraction with Earth Mover’s Distance in Imperfect-Information Games☆16Updated 6 years ago
- ☆13Updated 2 years ago
- This code is based on the implementation of http://www.cs.cmu.edu/afs/cs/Web/People/sandholm/potential-aware_imperfect-recall.aaai14.pdf,…☆34Updated 6 years ago
- Neural Fictitious Self-Play in Leduc Holdem☆11Updated 6 years ago
- Scalable implementation of DREAM - Deep RL for multi-agent imperfect information games☆115Updated 8 months ago
- Multi-Agent RL Environment for the Stratego Board Game (and variants)☆34Updated last year
- Results reproductions & comparisons between OpenSpiel implementations, associated paper & originating works☆17Updated 4 years ago
- Code for "AutoCFR: Learning to Design Counterfatual Regret Minimization Algorithms", AAAI 2022 (Oral)☆17Updated 11 months ago
- Counterfactual Regret Minimization☆29Updated 7 years ago
- Deep RL Code for XDO: A Double Oracle Algorithm for Extensive-Form Games☆38Updated 3 years ago
- Simple implementation of regret matching algorithm for RPS nash equilibrium computation via self-play☆25Updated 6 years ago
- Code for the paper "Skynet: A Top Deep RL Agent in the Inaugural Pommerman Team Competition"☆37Updated 5 years ago
- Code for Model-Free Opponent Shaping (ICML 2022)☆18Updated 2 years ago
- ☆18Updated 5 years ago
- Monte Carlo Conterfactual Regret Minimization for imperfect information games☆13Updated 6 years ago
- Hierarchical Self-Play☆21Updated 6 years ago
- ☆9Updated 3 years ago
- Counterfactual Regret Minimization (CFR) sample code in Python☆14Updated 5 years ago
- This is an implementation of DeepStack for No Limit Texas Hold'em, extended from DeepStack-Leduc.☆26Updated 5 years ago
- A game theory framework with examples and algorithms☆73Updated 5 years ago
- Code for magnetic mirror descent.☆16Updated last year
- Counterfactual regret minimization algorithm for Kuhn poker☆170Updated 6 years ago
- Counterfactual regret minimization for multi-domain operations☆8Updated 4 years ago
- ☆27Updated 5 years ago
- Python implementation of Deepstack☆83Updated 5 years ago