cs.GT · 2026-10-14 · No. 143
Computer Science and Game Theory, 2026-10-14.
2 new papers in cs.GT. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
2 entries-
01
Linear Last-Iterate Convergence Rates for Optimistic Learning in Harmonic Games
John Lazarsfeld, Anas Barakat, Jacob Abernethy, Vidya Muthukumar, Georgios Piliouras, Andre Wibisono, Juba Ziani
cs.GT · cs.LG
We prove that the last iterate of Optimistic Follow-The-Regularized-Leader (OFTRL) converges at a linear rate to a Nash equilibrium in multiplayer harmonic games. Our result holds under a mild game-regularity condition and for a large family of regularizers, including entropy, Tsallis, and log-barrier. Our analysis is based on a dual perspective of OFTRL: we prove that the interaction between optimism and the global structure of harmonic...
-
02
When Does Opponent Modeling Pay Off? Spatial Inference Stabilises Reinforcement Learning under Partial Observability
Marcel Petran, Stefan Edelkamp
cs.GT · cs.LG · cs.MA
Deep reinforcement learning agents in partially observable competitive games must act on beliefs about an unseen opponent's intent. We study a spatial opponent model: a transformer trained with hindsight-relabelled opponent goals that outputs a subgoal heatmap from the opponent's observed trajectory, fused early into a dueling double DQN. In symmetric constant-sum foraging games with partial observability, the module stabilises training....
This edition is part of The Daily Abstract — cs.GT archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.