When network structure makes strategic opposites equivalent

What the study found

Neary reports that, in binary-action games on bipartite networks, strategic complements and strategic substitutes can be transformed into one another by relabelling the actions of every player on exactly one side of the network. A bipartite network is one whose nodes can be divided into two groups, with connections only between groups.

The author states that bipartiteness is both necessary and sufficient for this relabelling. As a consequence, the preprint identifies bipartite networks as precisely those on which every binary-action game with strategic substitutes must have a pure-strategy Nash equilibrium: an outcome in which each player chooses one action and no player can benefit by changing their own action alone.

Why it matters

Strategic complements and substitutes describe contrasting relationships between players’ choices. The claimed equivalence gives researchers a way to relate the two settings when the network has the required structure. The equilibrium result also links a structural property of a network to a guarantee about games played on it.

Limits and unknowns

These are theoretical claims reported in an arXiv preprint, not evidence from an empirical study. The abstract does not provide the proofs, detailed assumptions or examples, so the scope and reasoning cannot be assessed fully from it alone. The stated results concern binary-action games; the abstract does not establish that they extend to games with more actions.