Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

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.

Marc Lanctot, Edward Lockhart, Jean-Baptiste Lespiau, Vinicius Zambaldi, Satyaki Upadhyay, Julien P\'erolat, Sriram Srinivasan, Finbarr Timbers, Karl Tuyls, Shayegan Omidshafiei, Daniel Hennes, Dustin Morrill, Paul Muller, Timo Ewalds, Ryan Faulkner, J\'anos Kram\'ar, Bart De Vylder, Brennan Saeta, James Bradbury, David Ding, Sebastian Borgeaud, Matthew Lai, Julian Schrittwieser, Thomas Anthony, Edward Hughes, Ivo Danihelka, Jonah Ryan-Davis• 2019

Related benchmarks

TaskDatasetResultRank
CFR solver performanceKuhn Poker
Average Iteration Time1.04
4
CFR solver performanceTiny battleship
Average Iteration Time1.03
4
CFR solver performanceBattleship Small
Average Iteration Time5.38
4
Counterfactual Regret MinimizationLeduc Poker
Average Iteration Time (ms)13.4
4
CFR solver performanceLiar's Dice
Average Iteration Time (s)1.53
4
CFR solver performancebattleship Medium
Average Iteration Time22.8
4
CFR solver performanceLarge battleship
Average Iteration Time89.6
4
Mean-field updateLinear Quadratic environment 100 states and 7 actions
Mean-Field Update (s)0.0054
4
Showing 8 of 8 rows

Other info

Follow for update