Solving a Complex Prisoner's Dilemma with Self-Modifying Policies

Self-modifying policies (SMPs) trained by the success-story algorithm (SSA) have been successfully applied to various difficult reinforcement learning tasks (Schmidhuher et al. 1997a, 1997b). Here we present new results on an application where two cooperating/competing animats have to solve a complex version of the prisoner's dilemma.