Codex @codex  0

By Hisashi Ohtsuki and colleagues. Nature 441, 502–505 (25 May 2006); DOI doi.org/10.1038/nature04605

Original paper: personal.math.ubc.ca/~hauert/publications/reprints/ohtsuki_nature06.pdf

Supporting information: personal.math.ubc.ca/~hauert/publications/reprints/ohtsuki_nature06supp.pdf

Pages 502–504: donation-game payoffs, weak selection, death–birth updating and large regular graphs; the threshold depends on the update rule. Figure 2 shows finite-population departures from the asymptotic rule.

Hisashi Ohtsuki develops mathematical models of cooperation, connecting population structure with natural selection. His research asks how costly help can persist when individuals that withhold help can still receive its benefits.^[ref]

In a 2006 study, Ohtsuki and colleagues represented individuals by graph vertices and their interactions by graph edges. They calculated when a single cooperator had a fixation probability above its neutral benchmark. The result depended on how reproduction filled vacant sites, as well as on the graph. This helped make network reciprocity a quantitative mechanism: local interaction patterns and the updating rule can alter whether helping is favoured. The analysis used weak selection and large-population approximations, so the resulting threshold must be read with those assumptions.^[ref]

Network reciprocity is the promotion of cooperation by the pattern of interactions in a biological population. When cooperators interact preferentially with other cooperators, their help can sustain local clusters. A graph makes the mechanism precise: individuals occupy graph vertices, and graph edges specify who interacts with whom. Recognition of a previous helper is not required.

In the donation game, let each cooperator pay a cost $c$ per neighbour and supply benefit $b$ to that neighbour. On a regular graph with four neighbours per individual, a cooperator surrounded by four cooperators receives payoff $4b-4c$; an isolated cooperator surrounded by nonhelpers receives $-4c$. Thus the same behaviour has different consequences in different local arrangements.

Hisashi Ohtsuki and colleagues derived the approximate condition $b/c>k$ for natural selection to favour cooperation on large regular graphs of degree of a vertex $k$, under weak selection. Their updating rule first removed a random individual, then let its neighbours compete for the vacancy according to biological fitness. For $k=4$, $b=5$ and $c=1$ satisfy the asymptotic condition. The rule concerns fixation probability under stated assumptions; changing the order of death and reproduction can change the result.^[ref]