Skip to content
Open access

When Can the Weaker Player Win? A Game-Theoretic Model of Humans Against a More Powerful AI

Sep 2026 · Games · Vol 17, pp. 51 · 0 citations · 16 references

TL;DR

It is proved that in closed, strictly competitive games enough computation drives the human to the classical security value and creativity is worthless; that creativity has value exactly when an unmodeled move beats the AI’s best defense.

Abstract

As AI systems approach and surpass human ability across more and more tasks, we ask a deliberately pessimistic question: if a far more capable AI turned adversarial, are there still games a human could win, and how? We give a game-theoretic answer. The intuition that “more capable means it wins everything” treats capability as a single number; we instead model it as a seven-component vector: optimization depth, predictive accuracy, observability, action breadth, tempo, commitment, and creativity. A human out-matched on the five computational components can still retain decisive leverage on the remaining two: outright superiority on creativity, the ability to play moves outside the AI’s model of the human, formalized through games with unawareness; and parity on commitment, the ability to move first and bind oneself. We prove that in closed, strictly competitive games enough computation drives the human to the classical security value and creativity is worthless; that creativity has value exactly when an unmodeled move beats the AI’s best defense; that a single inequality decides whether the human is favored; that commitment helps only under partial alignment; and that a creativity advantage is sustainable only if the human innovates faster than the AI’s combined learning-and-consumption rate. Reproducible Monte Carlo simulations numerically corroborate the quantitative results, and we connect the resulting taxonomy of human–AI games to corrigibility and assistance-game designs in AI safety.

Read PDF

Similar papers

#artificial intelligence Review Aug 2026

AI Alignment through a Game-theoretic Lens: A Survey

This perspective clarifies where current alignment methods genuinely benefit from game-theoretic analysis, where the framework is looser, and what challenges remain in building robust, adaptive, and verifiable AI systems.

Yaxin Cai, Zhong-Rui Zhao, Zhi-Gang Lu et al. · 0 citations
Open access Oct 2026

Near-random behavior in strategic games.

Humans struggle to produce random behavior when asked to do so, leading some to suggest that our ability to randomize is attenuated (or even absent). Here, we demonstrate that the capacity for random behavior is much greater than previously acknowledged: Humans can behave in (near) optimally random ways when the contex...

Tal Boger, Dorsa Amir, S. Yousif · 0 citations
#artificial intelligence Preprint Sep 2026

The Convention Gap: Beyond Literal Content in Human-AI Cooperation

It is proved that the population gap is zero when the partner's choices convey nothing beyond their literal content, given a fair shuffle and a player who uses only what was said and seen, and argued for reporting the convention gap on human-partnered play, not only AI-AI performance, when evaluating agents intended fo...

Makoto Fukushima, Hua-Dong Xiong, E. M. Pari · 1 citation · ⚡1
#artificial intelligence Preprint Oct 2026

Can AI Agents Learn Their Way to the Top? Evaluating Heuristic Learning in a Long-Running Game Agent Competition

Adversarial games have driven advances from heuristic search to reinforcement learning, yet learning and adapting strategies from limited samples remain challenging. AI agents offer an alternative by turning game experience into revisions of executable policies. Building on heuristic learning (HL), we formalize Adversa...

Kai-Sen Yang, Qing-Le Liu, Ke-Jin Wang et al. · 0 citations
#natural language process... Preprint Oct 2026

Finding the Move Is Not Winning the Game: XiangqiBench for Closed-Loop Evaluation of LLM Agents

Static evaluations credit a language model for naming the right move, but an agent must carry a plan through to a verified outcome while an opponent responds. We introduce XiangqiBench, an executable benchmark that measures this difference in Chinese chess: starting from 119 tactical endgames with forced mates supporte...

Yekun Chai, Qiwei Peng, Hao-Yi Xiong · 0 citations
#artificial intelligence Preprint Oct 2026

Choosing LLMs for Strategic Agent Interactions

Game-theoretic benchmarks claim that large language model (LLM) strategic decision-making varies across game types, interaction structures, and capability dimensions. However, they only evaluate strategic performance across individual fixed models. In parallel, contemporary LLM routers pick models under quality-cost tr...

Arastun Mammadli, Herbert Woisetschläger, Jawad Fayaz et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.