From: Crozier’s paradox revisited: maintenance of genetic recognition systems by disassortative mating
Parameter | Range | Description |
---|---|---|
m | -1 to 1 | Determines mating system. Disassortative: m < 0, random: m = 0, assortative: m > 0. Mating becomes increasingly random as m approaches 0 |
b | 0 to ∞ | Benefit of receiving cooperation |
c | 0 to ∞ | Cost of performing cooperation |
x | 0 to ∞ | Number of additional offspring produced when mating partners have different recognition locus genotypes |
N | 2 to Population size | Patch size; assumed to be even. Population size was set at 10,000 in all simulations |
k | 2 to ∞ | Number of possible recognition alleles |
r | 0 to 0.5 | Recombination rate between the recognition and behaviour loci |
d | 0 to 1 | Probability that offspring disperse from the natal patch |
μ | 0 to 1 | Mutation rate of both loci |
h | 0 to 1 | Dominance of the cooperative allele; heterozygotes cooperate fully when h = 1, partially when 0 < h < 1, and never when h = 0 |