SOURCE-LINKED INTELLIGENCE

Symmetric solution of the Bellman optimality equation for repeated harmony game

arXiv · AI, language, vision and robotics · article · Sep 14, 2026 · UTC

In social dilemma games, additional rewards or punishments have been studied as means of promoting cooperation. Therefore, it is important to investigate the ideal situation, in which such an additional payoff would change the game. In this study, we investigated the symmetric solution of the Bellman optimality equation for a repeated harmony game. The calculations showed that three types of symmetric solutions exist. One of them corresponds to the trivial All-C strategy, and another to the Win-stay Lose-shift strategy of the prisoners dilemma game. The nontrivial behavior of the strategy corr

Read original source ↗ Open in workspace

recordType

paper

region

Global