We show that a concept of aggregation can hold for games played on networks. We first introduce the concept of aggregate Nash equilibrium. Furthermore, we show that the range of stability for aggregate Nash equilibria is larger that the range of stability of (standard) Nash equilibria. Finally, we provide an application to the model of public goods in networks to illustrate the usefulness of our results.