Do LLMs Beat Nash? Testing Decentralized Coordination in Self-Play Multi-Agent Games

• URL: http://arxiv.org/abs/2608.12547v1
• Date: Wed, 12 Aug 2026 19:36:53 GMT
• Title: Do LLMs Beat Nash? Testing Decentralized Coordination in Self-Play Multi-Agent Games
• Abstract summary: We introduce a benchmark of one-shot, no-communication games in which each of thirteen language models is told only that its counterparts are running the same model.<n>Two frontier-hosted models consistently exceed their Nash benchmark, approaching the optimal joint outcome in several archetypes.<n>Performance degrades substantially in team-based games with four or more interchangeable agents, particularly as the action space grows.
• Score: 7.3485258505401845
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Large language model agents deployed without a central controller are often assumed to require communication to coordinate their actions. We ask what remains possible without it: when independent instances of the same model cannot communicate, can they still reason about their counterparts well enough to exceed the standard game-theoretic baseline for uncoordinated play? We introduce a benchmark of one-shot, no-communication games in which each of thirteen language models is told only that its counterparts are running the same model and is evaluated against the Nash equilibrium of the underlying game. In two-player matrix games spanning seven archetypes and two to ten actions per player, two frontier-hosted models consistently exceed their Nash benchmark, approaching the optimal joint outcome in several archetypes, while most open-weight models achieve only partial gains that vary sharply by game structure. Performance degrades substantially in team-based games with four or more interchangeable agents, particularly as the action space grows, suggesting that whatever capability drives self-play gains in dyadic games does not transfer to larger multi-agent teams.

Related papers

• When Agents Lie: Premeditation, Persistence, and Exploitation in Repeated Games [69.060029640261]
  We evaluate three frontier models across six games in homogeneous and heterogeneous groups over 10 rounds.<n>Different models interpret announcements incompatibly, some as binding commitments and others as cheap talk.
  arXiv  Detail & Related papers  (2026-07-06T14:17:59Z)
• MINDGAMES: A Live Arena for Evaluating Social and Strategic Reasoning in Multi-Agent LLMs [54.81359054218573]
  We introduce Mindgames, a multi-game arena and evaluation platform for large language models (LLMs)<n>Mindgames provides a unified interaction interface, TrueSkill-based rating, and full trajectory logging across four game environments.<n>We analyze 29,571 multi-agent games with turn-level observations, actions, and rewards, together with MG-Ref, a deterministic offline tournament protocol.
  arXiv  Detail & Related papers  (2026-05-28T07:33:47Z)
• Agent Island: A Saturation- and Contamination-Resistant Benchmark from Multiagent Games [0.0]
  We introduce Agent Island, a multiplayer simulation environment in which language-model agents compete in a game of interagent cooperation, conflict, and persuasion.<n>We rank players with a Bayesian Plackett-Luce model, allowing us to quantify uncertainty in player skill.<n>In 999 games involving 49 unique models, openai/gpt-5.5 dominates its peers with a posterior mean skill of 5.64, compared with 3.10 for the second-ranked model, openai/gpt-5.2, and 2.86 for the third-ranked model, openai/gpt-5.3-codex.
  arXiv  Detail & Related papers  (2026-05-05T21:24:58Z)
• PlayGen-MoG: Framework for Diverse Multi-Agent Play Generation via Mixture-of-Gaussians Trajectory Prediction [0.40611352512781873]
  PlayGen-MoG is a framework for formation-conditioned play generation.<n>On American football tracking data, PlayGen-MoG achieves 1.68 yard ADE and 3.98 yard FDE.
  arXiv  Detail & Related papers  (2026-04-02T18:18:53Z)
• From Gameplay Traces to Game Mechanics: Causal Induction with Large Language Models [64.43268969806098]
  We investigate Causal Induction: the ability to infer governing laws from observational data.<n>We compare two approaches to VGDL generation: direct code generation from observations, and a two-stage method that first infers a structural causal model (SCM) and then translates it into VGDL.<n>Results show that the SCM-based approach more often produces VGDL descriptions closer to the ground truth than direct generation.
  arXiv  Detail & Related papers  (2026-01-30T08:48:23Z)
• LM Fight Arena: Benchmarking Large Multimodal Models via Game Competition [104.81487689011341]
  We introduce LM Fight Arena, a novel framework that evaluates large multimodal models in Mortal Kombat II.<n>Unlike static evaluations, LM Fight Arena provides a fully automated, reproducible, and objective assessment of an LMM's strategic reasoning capabilities.
  arXiv  Detail & Related papers  (2025-10-10T02:19:21Z)
• Model as a Game: On Numerical and Spatial Consistency for Generative Games [117.36098212829766]
  We revisit the paradigm of generative games to explore what truly constitutes a Model as a Game (MaaG) with a well-developed mechanism.<n>Based on the DiT architecture, we design two specialized modules: (1) a numerical module that integrates a LogicNet to determine event triggers, with calculations processed externally as conditions for image generation; and (2) a spatial module that maintains a map of explored areas, retrieving location-specific information during generation and linking new observations to ensure continuity.
  arXiv  Detail & Related papers  (2025-03-27T05:46:15Z)
• Efficacy of Language Model Self-Play in Non-Zero-Sum Games [38.644991461153275]
  We empirically investigate whether techniques like self-play can effectively be used to improve language models.<n>We finetune language models in self-play over multiple rounds of filtered behavior cloning in Deal or No Deal.<n>We find that language models improve substantially in self-play, achieving 14-17x higher scores in task reward after finetuning.
  arXiv  Detail & Related papers  (2024-06-27T03:52:35Z)
• Sports-Traj: A Unified Trajectory Generation Model for Multi-Agent Movement in Sports [53.637837706712794]
  We propose a Unified Trajectory Generation model, UniTraj, that processes arbitrary trajectories as masked inputs.<n>Specifically, we introduce a Ghost Spatial Masking (GSM) module, embedded within a Transformer encoder, for spatial feature extraction.<n>We benchmark three practical sports datasets, Basketball-U, Football-U, and Soccer-U, for evaluation.
  arXiv  Detail & Related papers  (2024-05-27T22:15:23Z)
• Towards convergence to Nash equilibria in two-team zero-sum games [17.4461045395989]
  Two-team zero-sum games are defined as multi-player games where players are split into two competing sets of agents. We focus on the solution concept of Nash equilibria (NE) We show that computing NE for this class of games is $textithard$ for the complexity class $mathrm$.
  arXiv  Detail & Related papers  (2021-11-07T21:15:35Z)
• Reinforcement Learning In Two Player Zero Sum Simultaneous Action Games [0.0]
  Two player zero sum simultaneous action games are common in video games, financial markets, war, business competition, and many other settings. We introduce the fundamental concepts of reinforcement learning in two player zero sum simultaneous action games and discuss the unique challenges this type of game poses. We introduce two novel agents that attempt to handle these challenges by using joint action Deep Q-Networks.
  arXiv  Detail & Related papers  (2021-10-10T16:03:44Z)
• Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games [40.851817668709494]
  We present a novel definition of Markov Potential Games (MPG)<n>MPG generalizes prior attempts at capturing complex stateful multi-agent coordination.<n>We show that MPGs showcase standard desirable properties such as the existence of deterministic Nash policies.
  arXiv  Detail & Related papers  (2021-06-03T16:17:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.