Equilibrium Residuals Expose Three Regimes of Matrix-Game Strategic Reasoning in Language Models
Wenhua Nie, Binhan Luo, Zijie Meng, Jyh-Shing Roger Jang, Ching-Wen Ma

TL;DR
This paper investigates how large language models understand strategic reasoning in matrix games, revealing different reasoning regimes and the importance of procedural evaluation for measuring true strategic capabilities.
Contribution
It identifies three regimes of strategic reasoning in language models and introduces residuals as a measure of approximate equilibrium computation, with theoretical and experimental insights.
Findings
Models perform poorly on anonymous matrix games, dropping to near chance levels.
Supervised fine-tuning significantly improves performance on larger, unseen games.
Residuals are Lipschitz continuous in payoff perturbations, enabling transferability.
Abstract
Large language models can score well on named game-theory benchmarks while failing on the same strategic computation once semantic cues are removed. We show this gap with procedurally generated zero-sum matrix games: a model that recognizes familiar games drops to 34%, 18%, and 2% success on anonymous , , and payoff matrices. The benchmark separates semantic recall, learned approximate Nash computation, and an output-interface bottleneck that limits scale. Training only on and games, supervised fine-tuning raises unseen -- success from 2% to 61%, while exploitability-reward training averages 37% with high seed variance. We prove that the exploitability residual is -Lipschitz in payoff perturbations, unlike discontinuous vertex-returning LP equilibrium selectors, explaining why residual training can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
