Ref: Dugatkin, L. A., & Wilson, D. S. (1991). Rover: A strategy for exploiting cooperators in a patchy environment. American Naturalist, 138, 687-701.
The Model:
A population of TFT and ALL-D individuals, randomly distributed in patches of size M + 1. Encounters within a patch occur at random. There is a cost tau to move to a new patch, and patches are never re-visited within the memory span of agents. ROVER is the ALL-D which optimizes the time it stays in a patch vs. migrates to a new patch. TFT agents always stay. If the cost to move is low enough, ROVER can invade and spread either to fixation or a stable equilibrium.
TFT agents have perfect memory - always remember who defected.
Movement cost is fixed.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment