OpenSpiel: A Framework for Reinforcement Learning in Games
About
OpenSpiel is a collection of environments and algorithms for research in general reinforcement learning and search/planning in games. OpenSpiel supports n-player (single- and multi- agent) zero-sum, cooperative and general-sum, one-shot and sequential, strictly turn-taking and simultaneous-move, perfect and imperfect information games, as well as traditional multiagent environments such as (partially- and fully- observable) grid worlds and social dilemmas. OpenSpiel also includes tools to analyze learning dynamics and other common evaluation metrics. This document serves both as an overview of the code base and an introduction to the terminology, core concepts, and algorithms across the fields of reinforcement learning, computational game theory, and search.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| CFR solver performance | Kuhn Poker | Average Iteration Time1.04 | 4 | |
| CFR solver performance | Tiny battleship | Average Iteration Time1.03 | 4 | |
| CFR solver performance | Battleship Small | Average Iteration Time5.38 | 4 | |
| Counterfactual Regret Minimization | Leduc Poker | Average Iteration Time (ms)13.4 | 4 | |
| CFR solver performance | Liar's Dice | Average Iteration Time (s)1.53 | 4 | |
| CFR solver performance | battleship Medium | Average Iteration Time22.8 | 4 | |
| CFR solver performance | Large battleship | Average Iteration Time89.6 | 4 | |
| Mean-field update | Linear Quadratic environment 100 states and 7 actions | Mean-Field Update (s)0.0054 | 4 |