Sign games on graphs

Abstract

We define the Sign Game as a two-player game played on a simple undirected mathematical graph $G$. The players alternate turns, assigning vertices of $G$ either $1$ or $-1$, and edges take on the value of the product of their endvertices. The game ends when all vertices are assigned values, and the score of the game is the sum of all edge values. One player's goal is to make the score positive while the other's is to make the score negative. In this paper we investigate the game being played on various types of graphs, determining outcomes and winning strategies.