Abstract
Following Axelrod's tournaments for strategies in the repeat-play prisoner's dilemma, we ran a ``tournament of party decision rules'' in a dynamic agent-based model of party competition. We asked researchers to submit rules for selecting party positions in a two-dimensional policy space, pitting each rule against all others in a suite of long-running simulations. The most successful rule combined a number of striking features: satisficing rather than maximizing in the short run, being ``parasitic'' on choices made by successful rules, and being hardwired not to attack other agents using the same rule. In a second suite of simulations in a more evolutionary setting in which the selection probability of a rule was a function of the previous success of agents using the same rule, the rule winning the original tournament pulled even further ahead of the competition.
Get full access to this article
View all access options for this article.
References
Supplementary Material
Please find the following supplemental material available below.
For Open Access articles published under a Creative Commons License, all supplemental material carries the same license as the article it is associated with.
For non-Open Access articles published, all supplemental material carries a non-exclusive license, and permission requests for re-use of supplemental material or any part of supplemental material shall be sent directly to the copyright owner as specified in the copyright notice associated with the article.
