By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$15 $15
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

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.