Pith. sign in

REVIEW 6 cited by

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

arxiv 2206.05825 v4 pith:M23IBZMZ submitted 2022-06-12 cs.LG cs.AIcs.GT

A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Games

classification cs.LG cs.AIcs.GT
keywords algorithmlearningreinforcementdescentfirstgamesmirrorachieve
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This work studies an algorithm, which we call magnetic mirror descent, that is inspired by mirror descent and the non-Euclidean proximal gradient algorithm. Our contribution is demonstrating the virtues of magnetic mirror descent as both an equilibrium solver and as an approach to reinforcement learning in two-player zero-sum games. These virtues include: 1) Being the first quantal response equilibria solver to achieve linear convergence for extensive-form games with first order feedback; 2) Being the first standard reinforcement learning algorithm to achieve empirically competitive results with CFR in tabular settings; 3) Achieving favorable performance in 3x3 Dark Hex and Phantom Tic-Tac-Toe as a self-play deep reinforcement learning algorithm.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Which Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopes

    cs.GT 2026-06 accept novelty 7.0

    Regularized last-iterate solvers select the maximum-entropy Nash equilibrium while regret-averaging methods select lower-entropy faces on zero-sum Nash polytopes, verified on analytic testbeds and a 180-game ensemble.

  2. Outbidding and Outbluffing Elite Humans: Mastering Liar's Poker via Self-Play and Reinforcement Learning

    cs.AI 2025-11 unverdicted novelty 7.0

    Solly is the first AI to achieve elite human-level play in reduced-format Liar's Poker via self-play actor-critic reinforcement learning, outperforming both world-class humans and large language models on win rate and...

  3. How Much Due Diligence Before You Bid? Learning in Intractable Takeover Auctions

    cs.AI 2026-06 unverdicted novelty 6.0

    Self-play RL in a takeover auction model shows optimal due diligence is modest and finite, decreasing with cost and competition, while simple general methods outperform specialized ones in large intractable games.

  4. GAE Falls Short in Imperfect-Information Self-Play Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 6.0

    GAE suffers from amplified variance in imperfect-info self-play RL; VRPO with Q-boosting and multi-step Expected SARSA(λ) reduces it and improves performance on mid-to-large games.

  5. Multiplayer Nash Preference Optimization

    cs.AI 2025-09 unverdicted novelty 6.0

    MNPO extends NLHF to multiplayer Nash games, inheriting equilibrium guarantees while showing empirical gains on instruction-following benchmarks under diverse preferences.

  6. FootsiesGym: A Fighting Game Benchmark for Two-Player Zero-Sum Imperfect-Information Games

    cs.AI 2026-07 accept novelty 5.0

    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.