It's a known problem. Eg check out optimal strategies to the prisoner's dilemma.<p><a href="https://en.wikipedia.org/wiki/Prisoner%27s_dilemma" rel="nofollow">https://en.wikipedia.org/wiki/Prisoner%27s_dilemma</a><p>> <i>The winning deterministic strategy was tit for tat, developed and entered into the tournament by Anatol Rapoport. It was the simplest of any program entered, containing only four lines of BASIC,[10] and won the contest. The strategy is simply to cooperate on the first iteration of the game; after that, the player does what his or her opponent did on the previous move.[11] Depending on the situation, a slightly better strategy can be "tit for tat with forgiveness": when the opponent defects, on the next move, the player sometimes cooperates anyway, with a small probability (around 1–5%, depending on the lineup of opponents). This allows for occasional recovery from getting trapped in a cycle of defections.</i><p>Extremely straightforward, and in real-world settings (business, politics, relationships), moderate forgiveness usually wins in the long run.