A spatial game features a population of agents, a metric space, and a symmetric 2-by-2 game. These programs place agents uniformly at random on the space, initializing them with random strategies. An agent is picked at random to revise its strategy until the process reaches equilibrium
The payoff to agent i is the weighted sum of payoffs from playing against every other agent in the population. The weight for an interaction between i and j is given by a (decreasing) function of the distance, d(i,j)
writeresults sweeps over population sizes and values of gamma (parameter acting as distance multiplier) producing a csv with proportion of initial conditions converging to HNE.
multihne tests a single pop size, value of gamma, and checks how frequently HNE is possible by repeatedly testing the same agent locations until HNE is found (or giving up)