Reasonably reasoning AI agents can avoid game-theoretic failures in zero-shot, provably
Enoch Hyunwook Kang

TL;DR
This paper proves that Bayesian AI agents can reliably converge to Nash equilibrium in repeated strategic settings, ensuring stability in AI-mediated markets without extensive fine-tuning.
Contribution
It extends theoretical economics to show Bayesian AI agents naturally approach equilibrium, with empirical validation across diverse repeated-game environments.
Findings
Bayesian posterior sampling guarantees convergence to Nash equilibrium.
Agents observe only stochastic payoffs, yet still reach equilibrium.
Empirical tests confirm theoretical convergence in five different game environments.
Abstract
As autonomous AI agents increasingly mediate online platform markets, a fundamental question emerges: do these markets generate stable strategic outcomes? In repeated strategic environments, the Nash equilibrium provides a natural benchmark for this stability. However, empirical evidence on off-the-shelf LLM agents is mixed, leaving it unclear whether independently deployed agents can converge to equilibrium behavior without explicit strategic post-training. In this paper, we provide an affirmative answer. Extending the Bayesian learning literature in theoretical economics, we prove that AI agents, acting as Bayesian posterior samplers rather than expected utility maximizers, are guaranteed to eventually become weakly close to a Nash equilibrium in infinitely repeated games. We further extend this analysis to settings in which stage payoffs are unknown ex ante, and agents observe only…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
