The neighbour-sum-distinguishing edge-colouring game

In this paper we study the neighbour-sum-distinguishing edge-colouring game on various classes of graphs. In particular, we prove that Bob wins the game on the complete graph Kn, n≥3, whoever starts the game, except when n=4. In that case, Bob wins the game on K4 if and only if Alice starts the game.