sipd - simulate the spatial iterated Prisoner's Dilemma

sipd-helporsipd[-widthinteger][-heightinteger][-stepsinteger][-roundsinteger][-seedinteger][-CCdouble][-CDdouble][-DCdouble][-DDdouble][-Iallcdouble][-Itftdouble][-Iranddouble][-Ipavdouble][-Iallddouble][-rcpdouble][-noisedouble][-mutedouble][-stats][-inv][-maginteger][-termstring]

The spatial iterated Prisoner's Dilemma is simulated and plotted over time according to the specified parameters. Each cell in a grid plays a specific strategy against its eight neighbors for several rounds. At the end of the last round, each cell copies the strategy of its most suc- cesful neighbor, which is then used for the next time step. Possible strategies include 'Always Cooperate,' 'Always Defect,'

-widthintegerWidth of world.-heightintegerHeight of world.-stepsintegerNumber of steps to simulate.-roundsintegerNumber of rounds per step.-seedintegerRandom seed for initial state.-CCdoubleReward Payoff.-CDdoubleSucker Payoff.-DCdoubleTemptation Payoff.-DDdoublePunish Payoff.-IallcdoubleInitial population of All-C.-ItftdoubleInitial population of TFT.-IranddoubleInitial population of Random.-IpavdoubleInitial population of Pavlov.-IallddoubleInitial population of All-D.-rcpdoubleProbability of C for Random strategy.-noisedoubleProbability of noise.-mutedoubleProbability of mutation.-statsPrint statistics?-invInvert all colors?-magintegerMagnification factor.-termstringHow to plot points.

The payoff matrix for the Prisoner's Dilemma game is usu- ally expressed as: Player B's Move +-----------+-----------+ Player A's Move | cooperate | defect | +-----------+-----------+-----------+ | cooperate | CC, CC | CD, DC | +-----------+-----------+-----------+ | defect | DC, CD | DD, DD | +-----------+-----------+-----------+ where the table entries are (A's payoff, B's payoff) and CC, CD, DC, and DD are the reward, sucker, temptation, and punish payoffs, respectively. For each of these four out- comes you will probably want the payoffs to reflect the relationships: (DC > CC > DD > CD) and ((CD + DC) / 2 < CC).

The option for the probability of mutation (-mute) corre- sponds to the act of a cell spontaneously changing to a randomly selected strategy independent of the outcome of the most recent set of rounds. random noise (via the -noise option) manifests itself as a cell making a randomly selected move in a single round. In this case, both the cell whose action was altered as well as that cell's opponents "remember" what the random move was on the next round. The value supplied with the -term option may be "none," in which case no graphic output is performed. This is useful if you simply want the statistics to be calculated for each time step (via the -stats option). The initial population levels for all strategies will be normalized, so the scaling of the option values is irrele- vant.

No sanity checks are performed to make sure that any of the options make sense.

Copyright (c) 1997, Gary William Flake. Permission granted for any use according to the standard GNU ``copyleft'' agreement provided that the author's com- ments are neither modified nor removed. No warranty is given or implied.

Man(1) output converted with man2html