In this paper, we show that a concept of aggregation can hold in large network games with linear best replies. Breaking … compute all Nash equilibria for the special network structure of cograph. A key finding is that a stable Nash equilibrium of … the large network game can be decomposed into a collection of Nash equilibria of subnetwork games. Thereby, we establish a …

In this paper, we show that a concept of aggregation can hold in network games. Breaking up large networks into smaller … provide an application to public goods in networks to show the usefulness of our results. In particular, we highlight network … architectures that cannot prevent free-riding in public good network games. Finally, we show that aggregation enhances the stability …