REVIEW 13 cited by
OpenSpiel: A Framework for Reinforcement Learning in Games
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Forward citations
Cited by 13 Pith papers
-
DungeonBench: A Benchmark for Rules-Rich Tactical Reasoning in Dungeons & Dragons Combat
DungeonBench scores LLM tactical play on D&D combat, finding frontier policies clear ~80% of single encounters but only 40% of linked multi-encounter days.
-
Solving Zero-Sum Convex Markov Games
Independent policy-gradient algorithms provably compute approximate Nash equilibria in two-player zero-sum convex Markov games.
-
Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization
In bilinear saddle-point games, adding a small penalty to only one player's payoff makes that player's equilibrium exact and gives gradient ascent-descent a linear last-iterate rate.
-
GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms
GUARD generates realistic security-game benchmarks from open data and shows that random games yield degenerate, defender-friendly equilibria.
-
IFlowNets: Extending Generative Samplers to Learn Strategies in Incomplete Information Games
IFlowNets make generative flow networks work for imperfect-information games by adding an information-set aggregation constraint that restores valid flow matching.
-
LeAct: Learning to Reason from Expert Actions
An AI can learn to reason by sampling explanations for an expert's actions and keeping only the ones that help it predict those actions.
-
TABX: A High-Throughput Sandbox Battle Simulator for Multi-Agent Reinforcement Learning
TABX is a JAX-based, GPU-accelerated, configurable multi-agent battle simulator that lets researchers vary units, terrain, and physics to benchmark cooperative MARL algorithms.
-
NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria
Periodically re-centering the KL-regularizer on the current policy in self-play yields a policy-gradient algorithm that, in its exact form, provably converges to a Nash equilibrium.
-
Benchmarking Partial Observability in Reinforcement Learning with a Suite of Memory-Improvable Domains
A JAX benchmark suite of nine memory-improvable partially observable RL environments, with evidence that recurrent and transformer agents beat memoryless baselines but fall short of state-augmented ceilings.
-
A Gold-Standard Study of What Makes a Lightweight Game-Playing Agent Strong
A controlled study using a fixed Gin Rummy expert as a yardstick isolates which lightweight RL training choices help (TRPO, knock-first reward, curriculum, warm-start, best-checkpoint) and which fail (imitation, dense...
-
FootsiesGym: A Fighting Game Benchmark for Two-Player Zero-Sum Imperfect-Information Games
FootsiesGym is an open-source, vectorized fighting-game benchmark for two-player zero-sum imperfect-information RL that isolates non-transitive neutral-game dynamics while remaining tractable on standard hardware.
-
Conservative Equilibrium Discovery in Offline Game-Theoretic Multiagent Reinforcement Learning
COffeE-PSRO combines conservative uncertainty penalties with robust replicator dynamics to extract lower-regret equilibrium profiles from offline multi-agent datasets.
-
Multi-Agent Reinforcement Learning in Cybersecurity: From Fundamentals to Applications
A narrative survey of multi-agent reinforcement learning for cyber defense, reviewing game-theoretic models, cyber gyms, and applications, concluding MARL is promising but faces scalability and simulation-to-real tran...
Discussion (0). Continue with ORCID to comment.