Analysing territorial models on graphs (Q394121)

The paper is part of a growing literature that studies spatial games (or games on graphs), i.e. the effect of specific interaction structures on the actions chosen by actors in a strategic environment. The authors study a multiplayer setting in which actors on the same node play a hawk-dove game and are allowed to move to their neighboring nodes. The considered types of graphs are the circle, and the 3-2 and 5-2 complete bipartite graphs. In this setting, the authors derive three main results. When comparing results to a well-mixed population of size larger than 3, a circle structure benefits doves and decreases the rate of hawks. Hawks on 3-2 bipartite graphs benefit from a low probability of raiding the larger territory and suffer from a higher probability when compared to a well-mixed population. For a sufficiently high probability of raiding the smaller territory of the bipartite graph, hawks generally prefer the well-mixed population to a 5-2 bipartite graph. A proper understanding of the paper requires, however, that the reader is familiar with the previous work by the authors, since some concepts are only sketched and insufficiently elaborated for readers unfamiliar with the literature.