Symmetric solution of the Bellman optimality equation for repeated harmony game

arXiv:2609.16289 · cs.GT, cs.AI, cs.LG · Submitted 2026-09-14 · Read on arXiv

cs.GT, cs.AI, cs.LG

Submitted: 2026-09-14

Updated: 2026-09-14

Comments: 22 pages, 2 figures

Code: https://github.com/Hisato-Komatsu/Repeated_Harmony

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Cooperation — 20× in this paper · explained in 2 episodes
• Reinforcement Learning — 11× in this paper · explained in 4 episodes
• Q-learning — 4× in this paper · explained in 3 episodes
• Win-stay Lose-shift — 3× in this paper
• Frequent Handshake — 2× in this paper
• Nash Equilibrium — 2× in this paper · explained in 2 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Generative AI — 1× in this paper · explained in 2 episodes

Related papers

• Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
• In-Context Credit Assignment via the Core
• Breaking 1/epsilon Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
• Enhancing Affine Maximizer Auctions with Correlation-Aware Payment
• LLM Bidders Preserve the Mechanism-Level Orderings of Human Bidders
• Towards Performatively Stable Equilibria in Decision-Dependent Games for Arbitrary Data Distribution Maps