Many migration strategies have been proposed forPrisoner's Dilemma game on square lattice, such as randommigration, success-driven migration and adaptive migration. Inthis paper, we introduce three novel migration strategies: failure driven migration, hate-driven migration and global-scope migration. Based on the length of migration, individual with one of the first two strategies decides when and where to move into empty nearby places based on its performance in current site, while individual with a global-scope migration can move to anywhere. Then we compare them with the cases of no migration, random migration and success-driven migration. The simulations show that the failure-driven migration has the best performance in most circumstances. While defectors dominate in success-driven migration cases.
展开▼
