Search arXivSearch

arXiv · 2603.10029

Auditing Game-Theoretic Measures of Strategic Reasoning in LLMs

Abstract

Game-theoretic benchmarks can separate distinct forms of strategic behavior in LLMs that aggregate theory of mind scores do not distinguish, but only if those benchmarks measure what they claim. We audit a four-game framework and a sealed-bid auction control based on 1,855 interactions among seven LLMs, correcting its first release against the raw transcripts. A 1,024-token completion limit caused some models to return empty answers that parsers silently replaced with fixed actions, invalidating the reported Kimi K2 profile and contaminating measurements in all game types. A solution of the implemented signaling game also replaces the previously reported equilibrium bluff target of 0.340 with a conditional rate of 2/3. On valid responses, bluff propensity ranges from 0.109 to 0.732 across models. A fitted model-specific propensity predicts held-out choices as well as or better than every equilibrium and QRE candidate tested. The equilibrium's type-level prescriptions are rejected for every model where they can be tested, and its aggregate rate keeps pace only when a model's own rate happens to be similar. Surviving valid cells cannot identify the previously reported cross-axis correlation. Finally, correcting an analysis-layer bug in the prompt-framing study reverses a prior result: reframing leaves Claude Haiku's bluff rate unchanged near 0.59 but raises GPT-4o-mini's greatly, from 0.08 to 0.65-0.67. Framing effects are model-dependent, and the measurements remain framing-conditional. We therefore treat fitted lambda values as payoff- and model-dependent summaries instead of structural rationality parameters. The transcript corpus and per-move validity masks are available at https://doi.org/10.5281/zenodo.21943627. The exact solver and correction pipeline will accompany a future release. Appendix itemizes the changes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mateo Pechon-Elkins, Jon Chun. 2026-08-23. Auditing Game-Theoretic Measures of Strategic Reasoning in LLMs. https://arxiv.org/abs/2603.10029

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT

Equilibrium and Infeasibility: A new solution concept for games

Addressing infeasibility in non-cooperative games has become an important topic, as many problems across different applications face this issue. In this paper, we propose a new solution concept for generalized games with possibly infeasible individual constraints. A solution is defined as the limit of a sequence of generalized Nash equilibria induced by games with penalty terms relaxing the individual constraints. Existence is established for a broad range of games and we provide conditions allowing to characterize a $ψ$-penalized solution as a strategy profile maximizing every player's utility over all her penalty minimizing strategies. A variation of Divide-the-Dollar serves as an illustrative example. We further establish the compatibility with the GNE and the solution to the Nash bargaining.

cs.GT

Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots

We consider sequential Plurality elections in which each voter may abstain or vote for a single candidate. Each voter assigns utilities to all candidates; for each voter, this induces a (weak) order over the candidates. Ties are resolved uniformly at random, and voting has a small positive cost, so that a voter prefers to abstain when their vote cannot change the election outcome. We consider a variant of this model where, for each voter, we additionally specify a prefix of her ranking, so that she is only allowed to vote for a candidate from that prefix (or abstain). We prove that for this variant of the model, deciding whether a designated candidate is among the election winners in a subgame-perfect equilibrium of the associated extensive-form game is PSPACE-complete. This partially resolves an open problem from the work of Desmedt and Elkind [2010].

cs.GT