arXiv:2610.13995v1 Announce Type: cross
Abstract: Post-training large language models (LLMs) on two-player zero-sum games provides a verifiable reward, and the gains have been shown to transfer to ge...
By Weixian Waylon Li, Jiaxin Zhang, Han Zhou, Chengzu Li, Ke Wang, Fengxiang He, Yiwen Guo
arXiv:2607. 21856v1 Announce Type: new Abstract: Modern reasoning models depend on reasoning data, today sourced from human annotations or distilled from stronger LLMs.
By Ziran Yang, Chengshuai Shi, Raj Ghugare, Benjamin Eysenbach, Karthik Narasimhan, Chi Jin
The paper introduces the Abstraction Agent, a zero‑shot pipeline that employs a large language model to automatically generate continuous strategic features from a natural‑language game description, score private states, and cluster them into abstraction buckets without any game‑specific evaluators or training data. The pipeline consists of four phases—feature discovery with calibration anchors, batched private‑state scoring, correlation‑based feature selection, and k‑means clustering—and achieves significant reductions in lifted‑strategy exploitability in heads‑up no‑limit Texas hold’em and outperforms scalar rank baselines in ROVER Trials. The method also transfers to other games such as four‑card Pot‑Limit Omaha, HUNL preflop and flop, and Riichi Mahjong, demonstrating that it can uncover strategic concepts that align with recognized game theory insights.
By Boning Li, Longbo Huang
The paper presents a symbolic sub‑policy model for chess that incorporates domain knowledge to improve interpretability. By adapting patterns learned through inductive logic programming (PAL), the authors evaluate the model using a divergence metric against a random baseline and show that it can suggest moves comparable to a human beginner. They also propose a computational evaluation scheme that augments an existing engine with their model.
By Abhijeet Krishnan, Chris Martens
arXiv:2508. 11874v2 Announce Type: replace-cross Abstract: Designing polynomial-time algorithms for approximate Nash equilibria (ANE) with provable worst-case guarantees is a fundamental open problem in algorithmic game theory.
By Hanyu Li, Dongchen Li, Xiaotie Deng
The paper introduces the Algebraic World Model (AWM), a framework that lets an AI explore unfamiliar environments, generate executable Python hypotheses, refine them through category‑theory guided transformations, and formalize the resulting model in Lean 4 to prove reachability and impossibility. AWM demonstrates its ability to formally prove that certain game goals are unreachable, outperforming large language models such as Claude Opus 5.5 and GPT‑6 Astra on impossible levels, and it produces interpretable mathematical models that enable Lean to replay and generalize winning trajectories across 25 public ARC‑AGI‑3 games.
By Guancheng Pan, Qixin Tan, Yang Yuan, Andrew Chi-Chih Yao