 As Skyrms 2004 notes, this matrix characterizes an ordinary stag hunt game, as defined above. In fact, Skyrms' observation is generally true. For any PD game \(g\), if \(n\) is sufficiently large, the \(n\)-generation haystack version of \(g\) is a stag hunt. A simple argument for this result is given in the following very short supplementary document: