In this paper, we show that a concept of aggregation can hold in large network games with linear best replies. Breaking up large networks into smaller subnetworks, which can be replaced by representative players, leads to a coarse-grained description of strategic interactions. This method of...

This paper proposes new centrality measures to characterise the 'key class', when agents in a network are sorted into role-equivalent classes, such that its removal results in an optimal change in the network activity. The notion of role-equivalence is defined through the graph-theoretical...

In this paper, we show that a concept of aggregation can hold in network games. Breaking up large networks into smaller pieces, which can be replaced by representative players, leads to a coarse-grained description of strategic interactions. This method of summarizing complex strategic...